×

Constant dimension codes from Riemann-Roch spaces. (English) Zbl 1384.94122

Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Then the involved codewords vector spaces. A subspace code \(C\) is a subset of the set of all subspaces of \(\mathbb{F}_q^N\). When all the subspaces of \(C\) have a fixed dimension then \(C\) is called constant dimension code.
In [J. P. Hansen, Int. J. Math. Comput. Sci. 10, No. 1, 1–11 (2015; Zbl 1384.94124)], the author presented a family of constant dimension linear network codes using algebraic curves over finite fields and certain Riemann-Roch spaces associated to divisors constructed from their rational points. In this article, the construction of Hansen is generalized to three families of codes, also of constant dimension. The three families are obtained by relaxing the conditions originally imposed by Hansen, which allows greater flexibility and variety. The parameters of the obtained codes are studied. Finally the authors give some numerical computations on the rates of the three families, showing the performance of these codes.

MSC:

94B05 Linear codes (general theory)
51E22 Linear codes and caps in Galois spaces

Citations:

Zbl 1384.94124
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] D. Bartoli, A note on Equidistant subspaces codes,, Discrete Appl. Math., 198, 291 (2016) · Zbl 1356.94102 · doi:10.1016/j.dam.2015.06.017
[2] A. Cossidente, On subspace codes,, Des. Codes Cryptogr., 78, 527 (2016) · Zbl 1355.94092 · doi:10.1007/s10623-014-0018-6
[3] T. Etzion, Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams,, IEEE Trans. Inform. Theory, 55, 2909 (2009) · Zbl 1367.94414 · doi:10.1109/TIT.2009.2021376
[4] T. Etzion, Codes and designs related to lifted MRD codes,, IEEE Trans. Inform. Theory, 59, 1004 (2013) · Zbl 1364.94597 · doi:10.1109/TIT.2012.2220119
[5] T. Etzion, Error-correcting codes in projective space,, IEEE Trans. Inform. Theory, 57, 1165 (2011) · Zbl 1366.94589 · doi:10.1109/TIT.2010.2095232
[6] M. Gadouleau, Constant-rank codes and their connection to constant-dimension codes,, IEEE Trans. Inform. Theory, 56, 3207 (2010) · Zbl 1366.94591 · doi:10.1109/TIT.2010.2048447
[7] R. L. Graham, <em>Concrete Mathematics: A Foundation for Computer Science</em>,, Addison-Wesley (1994) · Zbl 0836.00001
[8] J. P. Hansen, Riemann-Roch theorem and linear network codes,, Int. J. Math. Comput. Sci., 10, 1 (2015) · Zbl 1384.94124
[9] T. Honold, Optimal binary subspace codes of length \(6\), constant dimension \(3\) and minimum distance \(4\),, in Topics in Finite Fields, 632, 157 (2015) · Zbl 1355.94094
[10] A. Khaleghi, Subspace codes, Cryptography and coding,, in Lecture Notes in Compututer Science, 5921, 1 (2009)
[11] R. Koetter, Coding for errors and erasures in random network coding,, IEEE Trans. on Inform. Theory, 54, 3579 (2008) · Zbl 1318.94111 · doi:10.1109/TIT.2008.926449
[12] D. Silva, A rank-metric approach to error control in random network coding,, IEEE Trans. Inform. Theory, 54, 3951 (2008) · Zbl 1318.94119 · doi:10.1109/TIT.2008.928291
[13] A. L. Trautmann, New improvements on the echelon-ferrers construction,, in Proc. Int. Symp. on Math. Theory of Networks and Systems, 405 (2010)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.