Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric (2404.13230v1)

Published 20 Apr 2024 in cs.IT, math.CO, and math.IT

Abstract: Gabidulin codes, serving as the rank-metric counterpart of Reed-Solomon codes, constitute an important class of maximum rank distance (MRD) codes. However, unlike the fruitful positive results about the list decoding of Reed-Solomon codes, results concerning the list decodability of Gabidulin codes in the rank metric are all negative so far. For example, in contrast to Reed-Solomon codes, which are always list decodable up to the Johnson bound in the Hamming metric, Raviv and Wachter-Zeh (IEEE TIT, 2016 and 2017) constructed a class of Gabidulin codes that are not even combinatorially list decodable beyond the unique decoding radius in the rank metric. Proving the existence of Gabidulin codes with good combinatorial list decodability in the rank metric has remained a long-standing open problem. In this paper, we resolve the aforementioned open problem by showing that, with high probability, random Gabidulin codes over sufficiently large alphabets attain the optimal generalized Singleton bound for list decoding in the rank metric. In particular, they achieve list decoding capacity in the rank metric. Our work is significantly influenced by the recent breakthroughs in the combinatorial list decodability of Reed-Solomon codes, especially the work by Brakensiek, Gopi, and Makam (STOC 2023). Our major technical contributions, which may hold independent interest, consist of the following: (1) We initiate the study of higher order MRD codes'' and provide a novel unified theory, which runs parallel to the theory ofhigher order MDS codes'' developed by BGM. (2) We prove a natural analog of the GM-MDS theorem, proven by Lovett (FOCS 2018) and Yildiz and Hassibi (IEEE TIT, 2019), which we call the GM-MRD theorem. In particular, our GM-MRD theorem for Gabidulin codes are strictly stronger than the GM-MDS theorem for Gabidulin codes, proven by Yildiz and Hassibi (IEEE TIT, 2019).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (68)
  1. Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields. arXiv preprint arXiv:2304.09445, 2023. To appear in STOC 2024.
  2. AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1367–1378. SIAM, 2024.
  3. Rollo-rank-ouroboros, lake & locker. Second round submission to the NIST post-quantum cryptography call., 2019.
  4. Rank quasi cyclic (rqc). Second round submission to the NIST post-quantum cryptography call., 2019.
  5. An algebraic attack on rank metric code-based cryptosystems. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology - EUROCRYPT 2020, volume 12107 of Lecture Notes in Computer Science, pages 64–93. Springer, 2020.
  6. Improvements of algebraic attacks for solving the rank decoding and minrank problems. In Shiho Moriai and Huaxiong Wang, editors, Advances in Cryptology - ASIACRYPT 2020, volume 12491 of Lecture Notes in Computer Science, pages 507–536. Springer, 2020.
  7. Generalized GM-MDS: Polynomial codes are higher order MDS. arXiv preprint arXiv:2310.12888, 2023. To appear in STOC 2024.
  8. AG codes achieve list decoding capacity over constant-sized fields. arXiv preprint arXiv:2310.12898, 2023. To appear in STOC 2024.
  9. Lower bounds for maximally recoverable tensor codes and higher order MDS codes. IEEE Transactions on Information Theory, 68(11):7125–7140, 2022.
  10. Generic Reed-Solomon codes achieve list-decoding capacity. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 1488–1501, 2023.
  11. Rank-metric codes and their applications. Foundations and Trends® in Communications and Information Theory, 19(3):390–546, 2022.
  12. Invertible extractors and wiretap protocols. IEEE Transactions on Information Theory, 58(2):1254–1274, 2011.
  13. The cryptographic security of the syndrome decoding problem for rank distance codes. In Kwangjo Kim and Tsutomu Matsumoto, editors, Avances in Cryptology - ASIACRYPT ’96,, volume 1163 of Lecture Notes in Computer Science, pages 368–381. Springer, 1996.
  14. Philippe Delsarte. Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory, Ser. A, 25(3):226–241, 1978.
  15. Yang Ding. On list-decodability of random rank metric codes and subspace codes. IEEE Transactions on Information Theory, 61(1):51–59, 2014.
  16. On simple multiple access networks. IEEE Journal on Selected Areas in Communications, 33(2):236–249, 2014.
  17. On the existence of MDS codes over small fields with constrained generator matrices. In 2014 IEEE International Symposium on Information Theory, pages 1787–1791. IEEE, 2014.
  18. Florian Enescu. Commutative Algebra Lectures, Lecture 18. https://math.gsu.edu/fenescu/commalglectures/lect18.pdf, 2010. [Online; accessed 02-April-2024].
  19. Dimension Expanders via Rank Condensers. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), pages 800–814, 2015.
  20. List-decodability with large radius for Reed-Solomon codes. IEEE Trans. Inf. Theory, 68(6):3823–3828, 2022.
  21. A new public-key cryptosystem based on the problem of reconstructing p-polynomials. In Øyvind Ytrehus, editor, Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers, volume 3969 of Lecture Notes in Computer Science, pages 304–315. Springer, 2005.
  22. On identity testing of tensors, low-rank recovery and compressed sensing. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 163–172, 2012.
  23. Ernst Gabidulin. Theory of codes with maximum rank distance (translation). Problems of Information Transmission, 21:1–12, 01 1985.
  24. On the list-decodability of random linear codes. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 409–416. ACM, 2010.
  25. J. K. Gibson. Severely denting the Gabidulin version of the Mceliece public key cryptosystem. Designs, Codes and Cryptography, pages 37–45, 1995.
  26. J. K. Gibson. The security of the Gabidulin public-key cryptosystem. In Advances in Cryptology – EUROCRYPT’96, LNCS 1070,. Springer, 1996.
  27. Explicit subspace designs. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 608–617. IEEE Computer Society, 2013.
  28. Improved list-decodability and list-recoverability of Reed-Solomon codes via tree packings: [extended abstract]. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 708–719. IEEE, 2021.
  29. David Goss. Basic Structures of Function Field Arithmetic. Springer Science & Business Media, 1997.
  30. On the list-decodability of random linear rank-metric codes. In 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018, pages 1505–1509. IEEE, 2018.
  31. Lossless dimension expanders via linearized polynomials and subspace designs. Comb., 41(4):545–579, 2021.
  32. Improved decoding of reed-solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory, 45(6):1757–1767, 1999.
  33. List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for every rate. IEEE Trans. Inf. Theory, 69(4):2261–2268, 2023.
  34. Unbalanced expanders and randomness extractors from parvaresh–vardy codes. Journal of the ACM (JACM), 56(4):1–34, 2009.
  35. Extractors for images of varieties. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 46–59, 2023.
  36. Explicit list-decodable rank-metric and subspace codes via subspace designs. IEEE Trans. Inf. Theory, 62(5):2707–2718, 2016.
  37. List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound. In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC’13, Palo Alto, CA, USA, June 1-4, 2013, pages 843–852. ACM, 2013.
  38. Randomly punctured Reed-Solomon codes achieve the list decoding capacity over polynomial-size alphabets. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 164–176, 2023.
  39. R. Koetter and F. R. Kschischang. Coding for errors and erasures in random network coding. In IEEE International Symposium on Information Theory (ISIT 2007), pages 791–795. IEEE, 2007.
  40. Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory, 54(8):3579–3591, 2008.
  41. Maximum rank distance codes as space-time codes. IEEE Transactions on Information Theory, 49(10):2757–2760, 2003.
  42. A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Transactions on Information Theory, 51(5):1709–1730, 2005.
  43. Pierre Loidreau. Designing a rank metric based mceliece cryptosystem. In Post-Quantum Cryptography: Third International Workshop, PQCrypto 2010, Darmstadt, Germany, May 25-28, 2010. Proceedings 3, pages 142–152. Springer, 2010.
  44. Pierre Loidreau. A new rank metric codes based encryption scheme. In Post-Quantum Cryptography: 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings 8, pages 3–17. Springer, 2017.
  45. Shachar Lovett. MDS matrices over small fields: A proof of the GM-MDS conjecture. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 194–199. IEEE, 2018.
  46. List decoding of rank-metric codes with row-to-column ratio bigger than 1/2. In Kousha Etessami, Uriel Feige, and Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, volume 261 of LIPIcs, pages 89:1–89:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
  47. An analogue of berlekamp-massey algorithms for decoding codes in rank metric. Moscow Institute of Physics and Technology, 1991.
  48. Randomized decoding of gabidulin codes beyond the unique decoding radius. In Jintai Ding and Jean-Pierre Tillich, editors, PQCrypto 2020, volume 12100 of Lecture Notes in Computer Science, pages 3–19. Springer, 2020.
  49. Ron M Roth. Maximum-rank array codes and their application to crisscross error correction. IEEE transactions on Information Theory, 37(2):328–336, 1991.
  50. Ron M Roth. Higher-order MDS codes. IEEE Transactions on Information Theory, 68(12):7798–7816, 2022.
  51. LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding. Des. Codes Cryptogr., 89(6):1279–1319, 2021.
  52. Every list-decodable code for high noise has abundant near-optimal rate puncturings. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 764–773, 2014.
  53. Some Gabidulin codes cannot be list decoded efficiently at any radius. IEEE Transactions on Information Theory, 62(4):1605–1615, 2016.
  54. A correction to “some Gabidulin codes cannot be list decoded efficiently at any radius”. IEEE Transactions on Information Theory, 63(4):2623–2624, 2017.
  55. Efficient list-decoding of polynomial ideal codes with optimal list size. arXiv preprint arXiv:2401.14517, 2024.
  56. Richard Singleton. Maximum distance q-nary codes. IEEE Transactions on Information Theory, 10(2):116–118, 1964.
  57. D. Silva and F. R. Kschischang. Fast encoding and decoding of Gabidulin codes. In IEEE International Symposium on Information Theory (ISIT 2009). IEEE, 2009.
  58. A rank-metric approach to error control in random network coding. IEEE Transactions on Information Theory, 54(9):3951–3967, 2008.
  59. Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 538–551, 2020.
  60. Terence Tao. Topics in random matrix theory, volume 132. American Mathematical Society, 2023.
  61. Salil P. Vadhan. Pseudorandomness. Foundations and Trends® in Theoretical Computer Science, 7(1–3):1–336, 2012.
  62. Antonia Wachter-Zeh. Bounds on list decoding of rank-metric codes. IEEE Trans. Inf. Theory, 59(11):7268–7277, 2013.
  63. A new class of rank-metric codes and their list decoding beyond the unique decoding radius. IEEE Trans. Inf. Theory, 64(5):3394–3402, 2018.
  64. Gabidulin codes with support constrained generator matrices. IEEE Transactions on Information Theory, 66(6):3638–3649, 2019.
  65. Optimum linear codes with support-constrained generator matrices over small fields. IEEE Transactions on Information Theory, 65(12):7868–7875, 2019.
  66. Support constrained generator matrices of Gabidulin codes in characteristic zero. In 2020 IEEE International Symposium on Information Theory (ISIT), pages 60–65. IEEE, 2020.
  67. Algorithms for weakly secure data exchange. In 2013 International Symposium on Network Coding (NetCod), pages 1–6. IEEE, 2013.
  68. Weakly secure data exchange with generalized reed solomon codes. In 2014 IEEE International Symposium on Information Theory, pages 1366–1370. IEEE, 2014.
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

Youtube Logo Streamline Icon: https://streamlinehq.com

YouTube