Rigid linear binary codes

DOI10.1016/0097-3165(93)90028-7MaRDI QIDQ1207772zbMATH OpenOpenAlexFDO

Authors Hanno Lefmann, Kevin T. Phelps, Vojtěch Rödl

Publication date 23 May 1993

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(93)90028-7

zbMATH Keywords

\(d\)-dimensional subspacesnontrivial automorphism groupvector space over \(GF(2)\)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On linear rigidity of a class of codes
• New binary linear codes
• Publication:4552217
• Binary linear complementary dual codes
• Varieties of binary linear codes
• Minimal Binary Linear Codes
• Configuration in binary linear codes
• Binary Linear Codes That Are Optimal for Error Correction
• Publication:4884351
• Publication:4501019

Cites work

• Almost all self-dual codes are rigid
• Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
• On the inherent intractability of certain coding problems (Corresp.)

Cited in

(2)

• Linear binary code for write-once memories (Corresp.)
• On the asymptotic number of non-equivalent binary linear codes

This page was built for publication: Rigid linear binary codes

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