Singleton bounds for codes over finite rings
From MaRDI portal
Publication:5926296
DOI10.1023/A:1008767703006zbMath0979.94052MaRDI QIDQ5926296
Publication date: 21 February 2002
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Euclidean weightsgeneral weight functionHamming weightsLee weightsquasi-Froebenius ringSingleton bound
Related Items
Density of free modules over finite chain rings ⋮ Bounds in the Lee metric and optimal codes ⋮ Codes over an infinite family of rings with a Gray map ⋮ On maximum Lee distance codes ⋮ MDS and self-dual codes over rings ⋮ Structure of linear codes over the ring \(B_k\) ⋮ On the linear codes over the ring Z₄+v₁Z₄+...+v_{t}Z₄
Cites Work