On linear rigidity of a class of codes

zbMATH Open1354.94064MaRDI QIDQ892045FDOQ892045

N. E. Zubov

Publication date: 18 November 2015

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v11/p771-776.pdf

Recommendations

• On metric rigidity for some classes of codes
• On the equivalence of linear codes
• On linear codes which attain the Solomon-Stiffler bound
• On the maximality of linear codes
• On the extendability of linear codes
• A class of linear codes with good parameters
• A remark on linear codes
• Construction of a class of linear codes
• On matrix rigidity and locally self-correctable codes
• scientific article; zbMATH DE number 5043457

zbMATH Keywords

finite fieldlinear codeprime fieldcode automorphismcode symmetrylinear rigidity of codesMDS-code

Mathematics Subject Classification ID

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

Cited In (7)

• Rigid linear binary codes
• Forcing linearity on greedy codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On automorphisms of linear codes over a prime field
• On the characterization of linear uniquely decodable codes
• On linear codes which attain the Solomon-Stiffler bound

This page was built for publication: On linear rigidity of a class of codes

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