Additive Rank Metric Codes

Date

2017-01-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

183
views

0
downloads

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.

Subject Keywords

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

URI

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

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY

DOI

https://doi.org/10.1109/tit.2016.2622277

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Additive cyclic complementary dual codes over F4 Shi, Minjia; Liu, Na; Özbudak, Ferruh; Solé, Patrick (2022-10-01) © 2022 Elsevier Inc.An additive cyclic code of length n over F4 can be defined equivalently as an F2[x]/〈xn+1〉-submodule of F4[x]/〈xn+1〉. In this paper we study additive cyclic and complementary dual codes of odd length over F4 with respect to the trace Hermitian inner product and the trace Euclidean inner product. We characterize subfield subcodes and trace codes of these codes by their generators as binary cyclic codes.
SELF-DUALITY OF GENERALIZED TWISTED GABIDULIN CODES Otal, KAMİL; Özbudak, Ferruh; Willems, Wofgang (American Institute of Mathematical Sciences (AIMS), 2018-11-01) Self-duality of Gabidulin codes was investigated in [10]and the authors provided an if and only if condition for a Gabidulin code to be equivalent to a self-dual maximum rank distance (MRD) code. In this paper, we investigate the analog problem for generalized twisted Gabidulin codes (a larger family of linear MRD codes including the family of Gabidulin codes). We observe that the condition presented in [10] still holds for generalized Gabidulin codes (an intermediate family between Gabidulin codes and gene...
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.
A Bound on the Minimum Distance of Quasi-cyclic Codes Gueneri, Cem; Özbudak, Ferruh (2012-01-01) We give a general lower bound for the minimum distance of q-ary quasi-cyclic codes of length ml and index l, where m is relatively prime to q. The bound involves the minimum distances of constituent codes of length l as well as the minimum distances of certain cyclic codes of length m which are related to the fields over which the constituents are defined. We present examples which show that the bound is sharp in many instances. We also compare the performance of our bound against the bounds of Lally and Es...
Repeated - root cyclic codes and matrix product codes Özadam, Hakan; Özbudak, Ferruh; Department of Cryptography (2012) We study the Hamming distance and the structure of repeated-root cyclic codes, and their generalizations to constacyclic and polycyclic codes, over finite fields and Galois rings. We develop a method to compute the Hamming distance of these codes. Our computation gives the Hamming distance of constacyclic codes of length $np^s$\ in many cases. In particular, we determine the Hamming distance of all constacyclic, and therefore cyclic and negacyclic, codes of lengths p^s and 2p^s over a finite field of charac...

Citation Formats

K. Otal and F. Özbudak, “Additive Rank Metric Codes,” IEEE TRANSACTIONS ON INFORMATION THEORY, pp. 164–168, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/49198.