Partition-balanced families of codes and asymptotic enumeration in coding theory

DOI10.1016/j.jcta.2019.105169zbMath1467.94047arXiv1805.02049OpenAlexW2990083380WikidataQ126804264 ScholiaQ126804264MaRDI QIDQ2299619

Eimear Byrne, Alberto Ravagnani

Publication date: 21 February 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic enumerationdensity functionerror-correcting codeMDS codeHamming metricMRD coderank metricpartition-balanced family

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Asymptotic enumeration (05A16)

Related Items (14)

Density of free modules over finite chain rings ⋮ Common Complements of Linear Subspaces and the Sparseness of MRD Codes ⋮ Identifiers for MRD-codes ⋮ Weighted subspace designs from \(q\)-polymatroids ⋮ Rank-Metric Codes, Semifields, and the Average Critical Problem ⋮ Densities of codes of various linearity degrees in translation-invariant metric spaces ⋮ Bounds in the Lee metric and optimal codes ⋮ Saturating systems and the rank-metric covering radius ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\) ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ An Assmus--Mattson Theorem for Rank Metric Codes ⋮ Rank-Metric Codes and Their Applications ⋮ Rank-metric lattices

Cites Work

• Rank-metric codes and their duality theory
• A new family of linear maximum rank distance codes
• Algebraic structures of MRD codes
• Automorphism groups of Gabidulin-like codes
• MRD-codes and linear sets
• Theory of codes with maximum rank distance
• On t-covers in finite projective spaces
• Bilinear forms over a finite field, with applications to coding theory
• Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
• Rank metric codes and zeta functions
• Weight distribution of rank-metric codes
• On the genericity of maximum rank distance and Gabidulin codes
• Fast decoding of Gabidulin codes
• Partial spreads in random network coding
• New bounds for codes over finite Frobenius rings
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Packing and Covering Properties of Rank Metric Codes
• The Geometry of Two-Weight Codes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Weight distributions of geometric Goppa codes
• Fundamentals of Error-Correcting Codes
• On the Newton and covering radii of linear codes
• Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
• Covering Radius of Matrix Codes Endowed with the Rank Metric
• Maximum-rank array codes and their application to crisscross error correction
• The asymptotic density of sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partition-balanced families of codes and asymptotic enumeration in coding theory