A Class of Polynomial Codes

DOI10.1109/TIT.2004.826656MaRDI QIDQ3547805zbMATH OpenFDO

Authors Chaoping Xing, Yang Fang

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2004.826656

zbMATH Keywords

linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(10)

• A class of \(q\)-ary codes
• Polynomials generating Hamming codes
• On some classes of optimal and near-optimal polynomial codes.
• On the classification of geometric codes by polynomial functions
• A class of quaternary linear codes improving known minimum distances
• Codes from symmetric polynomials
• Rank weight hierarchy of some classes of polynomial codes
• scientific article; zbMATH DE number 3890761 (Why is no real title available?)
• Polyadic Codes Revisited
• Redundant residue polynomial codes

This page was built for publication: A Class of Polynomial Codes

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