Densities of codes of various linearity degrees in translation-invariant metric spaces

DOI10.1007/s10623-023-01236-2arXiv2208.10573OpenAlexW4378649699MaRDI QIDQ6130607

Anina Gruica, Nadja Willenborg, Anna-Lena Horlemann, Alberto Ravagnani

Publication date: 3 April 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.10573

zbMATH Keywords

graph theoryasymptotic densityGilbert-Varshamov boundHamming metricrank metricsum-rank metricsingleton-type boundsublinear codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• Improved identification schemes based on error-correcting codes
• On the genericity of maximum rank distance and Gabidulin codes
• Partition-balanced families of codes and asymptotic enumeration in coding theory
• On the sparseness of certain linear MRD codes
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• Polynomial Codes Over Certain Finite Fields
• Random codes: minimum distances and error exponents
• Fundamental Properties of Sum-Rank-Metric Codes
• Common Complements of Linear Subspaces and the Sparseness of MRD Codes
• Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations

This page was built for publication: Densities of codes of various linearity degrees in translation-invariant metric spaces