-
Previous Article
An active attack on a distributed Group Key Exchange system
- AMC Home
- This Issue
-
Next Article
On cross-correlation of a binary $m$-sequence of period $2^{2k}-1$ and its decimated sequences by $(2^{lk}+1)/(2^l+1)$
Constant dimension codes from Riemann-Roch spaces
1. | Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, 06123 Perugia, Italy |
2. | Department of Mathematics, University of Trento, Via Sommarive 14, 38123 Povo (Trento), Italy |
Some families of constant dimension codes arising from Riemann-Roch spaces associated with particular divisors of a curve $\mathcal{X}$ are constructed. These families are generalizations of the one constructed by Hansen.
References:
[1] |
D. Bartoli and F. Pavese,
A note on Equidistant subspaces codes, Discrete Appl. Math., 198 (2016), 291-296.
doi: 10.1016/j.dam.2015.06.017. |
[2] |
A. Cossidente and F. Pavese,
On subspace codes, Des. Codes Cryptogr., 78 (2016), 527-531.
doi: 10.1007/s10623-014-0018-6. |
[3] |
T. Etzion and N. Silberstein,
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, IEEE Trans. Inform. Theory, 55 (2009), 2909-2919.
doi: 10.1109/TIT.2009.2021376. |
[4] |
T. Etzion and N. Silberstein,
Codes and designs related to lifted MRD codes, IEEE Trans. Inform. Theory, 59 (2013), 1004-1017.
doi: 10.1109/TIT.2012.2220119. |
[5] |
T. Etzion and A. Vardy,
Error-correcting codes in projective space, IEEE Trans. Inform. Theory, 57 (2011), 1165-1173.
doi: 10.1109/TIT.2010.2095232. |
[6] |
M. Gadouleau and Z. Yan,
Constant-rank codes and their connection to constant-dimension codes, IEEE Trans. Inform. Theory, 56 (2010), 3207-3216.
doi: 10.1109/TIT.2010.2048447. |
[7] |
R. L. Graham, D. E. Knuth and O. Patashnik,
Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 2nd edition, 1994. |
[8] |
J. P. Hansen,
Riemann-Roch theorem and linear network codes, Int. J. Math. Comput. Sci., 10 (2015), 1-11.
|
[9] |
T. Honold, M. Kiermaier and S. Kurz, Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4, in Topics in Finite Fields, Gohar Kyureghyan, Gary L. Mullen, Alexander Pott Editors, Contemporary Mathematics, 632 (2015), 157-176. |
[10] |
A. Khaleghi, D. Silva and F. R. Kschischang, Subspace codes, Cryptography and coding, in Lecture Notes in Compututer Science, Springer, Berlin, 5921 (2009), 1-21. |
[11] |
R. Koetter and F. R. Kschischang,
Coding for errors and erasures in random network coding, IEEE Trans. on Inform. Theory, 54 (2008), 3579-3591.
doi: 10.1109/TIT.2008.926449. |
[12] |
D. Silva, F. R. Kschischang and R. Koetter,
A rank-metric approach to error control in random network coding, IEEE Trans. Inform. Theory, 54 (2008), 3951-3967.
doi: 10.1109/TIT.2008.928291. |
[13] |
A. L. Trautmann and J. Rosenthal, New improvements on the echelon-ferrers construction, in Proc. Int. Symp. on Math. Theory of Networks and Systems, 2010,405-408 |
show all references
References:
[1] |
D. Bartoli and F. Pavese,
A note on Equidistant subspaces codes, Discrete Appl. Math., 198 (2016), 291-296.
doi: 10.1016/j.dam.2015.06.017. |
[2] |
A. Cossidente and F. Pavese,
On subspace codes, Des. Codes Cryptogr., 78 (2016), 527-531.
doi: 10.1007/s10623-014-0018-6. |
[3] |
T. Etzion and N. Silberstein,
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, IEEE Trans. Inform. Theory, 55 (2009), 2909-2919.
doi: 10.1109/TIT.2009.2021376. |
[4] |
T. Etzion and N. Silberstein,
Codes and designs related to lifted MRD codes, IEEE Trans. Inform. Theory, 59 (2013), 1004-1017.
doi: 10.1109/TIT.2012.2220119. |
[5] |
T. Etzion and A. Vardy,
Error-correcting codes in projective space, IEEE Trans. Inform. Theory, 57 (2011), 1165-1173.
doi: 10.1109/TIT.2010.2095232. |
[6] |
M. Gadouleau and Z. Yan,
Constant-rank codes and their connection to constant-dimension codes, IEEE Trans. Inform. Theory, 56 (2010), 3207-3216.
doi: 10.1109/TIT.2010.2048447. |
[7] |
R. L. Graham, D. E. Knuth and O. Patashnik,
Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 2nd edition, 1994. |
[8] |
J. P. Hansen,
Riemann-Roch theorem and linear network codes, Int. J. Math. Comput. Sci., 10 (2015), 1-11.
|
[9] |
T. Honold, M. Kiermaier and S. Kurz, Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4, in Topics in Finite Fields, Gohar Kyureghyan, Gary L. Mullen, Alexander Pott Editors, Contemporary Mathematics, 632 (2015), 157-176. |
[10] |
A. Khaleghi, D. Silva and F. R. Kschischang, Subspace codes, Cryptography and coding, in Lecture Notes in Compututer Science, Springer, Berlin, 5921 (2009), 1-21. |
[11] |
R. Koetter and F. R. Kschischang,
Coding for errors and erasures in random network coding, IEEE Trans. on Inform. Theory, 54 (2008), 3579-3591.
doi: 10.1109/TIT.2008.926449. |
[12] |
D. Silva, F. R. Kschischang and R. Koetter,
A rank-metric approach to error control in random network coding, IEEE Trans. Inform. Theory, 54 (2008), 3951-3967.
doi: 10.1109/TIT.2008.928291. |
[13] |
A. L. Trautmann and J. Rosenthal, New improvements on the echelon-ferrers construction, in Proc. Int. Symp. on Math. Theory of Networks and Systems, 2010,405-408 |
Normalized weight | Rate | Normalized minimum distance | |
Normalized weight | Rate | Normalized minimum distance | |
Normalized weight | Rate | Normalized minimum distance | |
Normalized weight | Rate | Normalized minimum distance | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | |
[1] |
Anna-Lena Trautmann. Isometry and automorphisms of constant dimension codes. Advances in Mathematics of Communications, 2013, 7 (2) : 147-160. doi: 10.3934/amc.2013.7.147 |
[2] |
Natalia Silberstein, Tuvi Etzion. Large constant dimension codes and lexicodes. Advances in Mathematics of Communications, 2011, 5 (2) : 177-189. doi: 10.3934/amc.2011.5.177 |
[3] |
Roland D. Barrolleta, Emilio Suárez-Canedo, Leo Storme, Peter Vandendriessche. On primitive constant dimension codes and a geometrical sunflower bound. Advances in Mathematics of Communications, 2017, 11 (4) : 757-765. doi: 10.3934/amc.2017055 |
[4] |
Sascha Kurz. The interplay of different metrics for the construction of constant dimension codes. Advances in Mathematics of Communications, 2022 doi: 10.3934/amc.2021069 |
[5] |
Huimin Lao, Hao Chen. New constant dimension subspace codes from multilevel linkage construction. Advances in Mathematics of Communications, 2022 doi: 10.3934/amc.2022039 |
[6] |
Michael Braun. On lattices, binary codes, and network codes. Advances in Mathematics of Communications, 2011, 5 (2) : 225-232. doi: 10.3934/amc.2011.5.225 |
[7] |
Tatsuya Maruta, Yusuke Oya. On optimal ternary linear codes of dimension 6. Advances in Mathematics of Communications, 2011, 5 (3) : 505-520. doi: 10.3934/amc.2011.5.505 |
[8] |
Thomas Honold, Michael Kiermaier, Sascha Kurz. Constructions and bounds for mixed-dimension subspace codes. Advances in Mathematics of Communications, 2016, 10 (3) : 649-682. doi: 10.3934/amc.2016033 |
[9] |
B. K. Dass, Namita Sharma, Rashmi Verma. Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces. Advances in Mathematics of Communications, 2018, 12 (4) : 629-639. doi: 10.3934/amc.2018037 |
[10] |
Andries E. Brouwer, Tuvi Etzion. Some new distance-4 constant weight codes. Advances in Mathematics of Communications, 2011, 5 (3) : 417-424. doi: 10.3934/amc.2011.5.417 |
[11] |
Shanding Xu, Longjiang Qu, Xiwang Cao. Three classes of partitioned difference families and their optimal constant composition codes. Advances in Mathematics of Communications, 2022, 16 (3) : 465-483. doi: 10.3934/amc.2020120 |
[12] |
Daniel Heinlein, Sascha Kurz. Binary subspace codes in small ambient spaces. Advances in Mathematics of Communications, 2018, 12 (4) : 817-839. doi: 10.3934/amc.2018048 |
[13] |
Sabira El Khalfaoui, Gábor P. Nagy. On the dimension of the subfield subcodes of 1-point Hermitian codes. Advances in Mathematics of Communications, 2021, 15 (2) : 219-226. doi: 10.3934/amc.2020054 |
[14] |
Tsonka Baicheva, Iliya Bouyukliev. On the least covering radius of binary linear codes of dimension 6. Advances in Mathematics of Communications, 2010, 4 (3) : 399-404. doi: 10.3934/amc.2010.4.399 |
[15] |
Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco. Linear nonbinary covering codes and saturating sets in projective spaces. Advances in Mathematics of Communications, 2011, 5 (1) : 119-147. doi: 10.3934/amc.2011.5.119 |
[16] |
Angela Aguglia, Antonio Cossidente, Giuseppe Marino, Francesco Pavese, Alessandro Siciliano. Orbit codes from forms on vector spaces over a finite field. Advances in Mathematics of Communications, 2022, 16 (1) : 135-155. doi: 10.3934/amc.2020105 |
[17] |
Ettore Fornasini, Telma Pinho, Raquel Pinto, Paula Rocha. Composition codes. Advances in Mathematics of Communications, 2016, 10 (1) : 163-177. doi: 10.3934/amc.2016.10.163 |
[18] |
Alexis Eduardo Almendras Valdebenito, Andrea Luigi Tironi. On the dual codes of skew constacyclic codes. Advances in Mathematics of Communications, 2018, 12 (4) : 659-679. doi: 10.3934/amc.2018039 |
[19] |
Somphong Jitman, Ekkasit Sangwisut. The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order. Advances in Mathematics of Communications, 2018, 12 (3) : 451-463. doi: 10.3934/amc.2018027 |
[20] |
Alessandro Carbotti, Giovanni E. Comi. A note on Riemann-Liouville fractional Sobolev spaces. Communications on Pure and Applied Analysis, 2021, 20 (1) : 17-54. doi: 10.3934/cpaa.2020255 |
2021 Impact Factor: 1.015
Tools
Metrics
Other articles
by authors
[Back to Top]