EXPLICIT CONSTRUCTIONS OF SOME NON-GABIDULIN LINEAR MAXIMUM RANK DISTANCE CODES

Download

index.pdf

Date

2016-08-01

Author

Otal, KAMİL
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

107
views

0
downloads

We investigate rank metric codes using univariate linearized polynomials and multivariate linearized polynomials together. We examine the construction of maximum rank distance (MRD) codes and the test of equivalence between two codes in the polynomial representation. Using this approach, we present new classes of some non-Gabidulin linear MRD codes.

Subject Keywords

Rank metric codes, Maximum rank distance (MRD) codes, Generalized Gabidulin codes

URI

https://hdl.handle.net/11511/46411

Journal

ADVANCES IN MATHEMATICS OF COMMUNICATIONS

DOI

https://doi.org/10.3934/amc.2016028

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Additive Rank Metric Codes Otal, KAMİL; Özbudak, Ferruh (2017-01-01) We give an infinite family of maximum rank distance (MRD) codes, which covers properly the largest known linear MRD code family. Our family contains infinite families of non-linear MRD codes, which are the first non-linear examples for most of the parameters. We also give explicit examples and a table that demonstrates the proportion of linear and non-linear families for some small parameters.
Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints GEİL, Olav; Özbudak, Ferruh (2017-08-31) We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in [12, Example 3.2]. Among the codes that we construct almost all have parameters as good as the best known codes according to [9] and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound [7,10] from Grobner basis theory and for this purpose we develop a new method where we inspired by Buchbergers algor...
Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes Koese, Seyda; Özbudak, Ferruh (2022-03-01) We determine the unique factorization of some polynomials over a finite local commutative ring with identity explicitly. This solves and generalizes the main conjecture of Qian, Shi and Sole in [13]. We also give some applications to enumeration of certain generalized double circulant self-dual and linear complementary dual (LCD) codes over some finite rings together with an application in asymptotic coding theory.
The Minimum Hamming Distance of Cyclic Codes of Length 2ps ÖZADAM, Hakan; Özbudak, Ferruh (2009-06-12) We study cyclic codes of length 2p(s) over F-q where p is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.
Factorization of Joint Probability Mass Functions into Parity Check Interactions Bayramoglu, Muhammet Fatih; Yılmaz, Ali Özgür (2009-07-03) We show that any joint probability mass function (PMF) can be expressed as a product of parity check factors an d factors of degree one with the help of some auxiliary variables, if the alphabet size is appropriate for defining a parity chec k equation. In other words, marginalization of a joint PMF is equivalent to a soft decoding task as long as a finite field can be constructed over the alphabet of the PMF. In factor graph terminology this claim means that a factor graph representing such a joint PMF alw...

Citation Formats

K. Otal and F. Özbudak, “EXPLICIT CONSTRUCTIONS OF SOME NON-GABIDULIN LINEAR MAXIMUM RANK DISTANCE CODES,” ADVANCES IN MATHEMATICS OF COMMUNICATIONS, pp. 589–600, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46411.