Bounds in the Lee metric and optimal codes
From MaRDI portal
Publication:2689354
DOI10.1016/j.ffa.2022.102151OpenAlexW4313654875MaRDI QIDQ2689354
Publication date: 10 March 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.06635
Related Items (1)
Cites Work
- Curve razionali normali e \(k\)-archi negli spazi finiti
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- On the genericity of maximum rank distance and Gabidulin codes
- Linear codes over finite chain rings
- Density of free modules over finite chain rings
- On maximum Lee distance codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- On the sparseness of certain linear MRD codes
- The extension theorem for Lee and Euclidean weight codes over integer residue rings
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- The structure of linear codes of constant weight
- Finite Rings with Applications
- Polynomial Codes Over Certain Finite Fields
- Lee metric codes over integer residue rings (Corresp.)
- MDR codes over Z/sub k/
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- On the Weights of General MDS Codes
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- Algebraic Coding Theory Over Finite Commutative Rings
- An upper bound on minimum distance for a k-ary code
- On channels and codes for the Lee metric
- Singleton bounds for codes over finite rings
This page was built for publication: Bounds in the Lee metric and optimal codes
