A class of linear codes with good parameters

DOI10.1109/18.868488MaRDI QIDQ2705940zbMATH OpenOpenAlexFDO

Authors Chaoping Xing, San Ling

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

zbMATH Keywords

linear codesparameterspolynomials

Mathematics Subject Classification ID

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

Recommendations

• Construction of a class of linear codes
• New code parameters from Reed-Solomon subfield codes
• On some classes of optimal and near-optimal polynomial codes.
• A class of linear codes with good parameters from algebraic curves
• Symmetric polynomials and some good codes

Cited in

(15)

• A class of optimal linear codes of length one above the Griesmer bound
• Linear spaces of quadrics and new good codes
• On some classes of optimal and near-optimal polynomial codes.
• On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\)
• Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes
• On trace codes and Galois invariance over finite commutative chain rings
• An explicit class of codes with good parameters and their duals
• A class of quaternary linear codes improving known minimum distances
• Construction of a class of linear codes
• Construction of global function fields from linear codes and vice versa
• Three classes of binary linear codes with good parameters
• gain analysis for switched systems with continuous-time and discrete-time subsystems
• Symmetric polynomials and some good codes
• On subfield subcodes obtained from restricted evaluation codes
• On linear rigidity of a class of codes

This page was built for publication: A class of linear codes with good parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2705940)