A class of linear codes with good parameters
From MaRDI portal
Publication:2705940
DOI10.1109/18.868488zbMath1003.94031OpenAlexW2164953993MaRDI QIDQ2705940
Publication date: 19 March 2001
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10220/9821
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (10)
On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\) ⋮ On some classes of optimal and near-optimal polynomial codes. ⋮ On trace codes and Galois invariance over finite commutative chain rings ⋮ gain analysis for switched systems with continuous-time and discrete-time subsystems ⋮ Three classes of binary linear codes with good parameters ⋮ Symmetric polynomials and some good codes ⋮ An explicit class of codes with good parameters and their duals ⋮ Construction of global function fields from linear codes and vice versa ⋮ Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes ⋮ A class of quaternary linear codes improving known minimum distances
This page was built for publication: A class of linear codes with good parameters
