Exploring invariant linear codes through generators and centralizers

DOI10.1080/09720529.2004.10697997MaRDI QIDQ4670755zbMATH OpenOpenAlexFDO

Authors P. P. Dey

Publication date 22 April 2005

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10338.dmlcz/107932

zbMATH Keywords

affine codescentralizers

Mathematics Subject Classification ID

Group actions on combinatorial structures (05E18) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 704211
• Subspace code based on flats in affine space over finite fields
• Preface: Special issue on algebraic and geometric perspectives on coding theory
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Affine nonsystematic codes
• The properties of code ZFD_d based on projective geometry
• An Anzahl formula for the number of subspaces in finite vector spaces and its application
• scientific article; zbMATH DE number 691472
• On the dimension of subfield subcodes
• scientific article; zbMATH DE number 218228

Cited in

(1)

• Complete classification of Hadamard products of codimension 1 subcodes of Reed-Muller codes

This page was built for publication: Exploring invariant linear codes through generators and centralizers

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