On generalized MacDonald codes

DOI10.2140/INVOLVE.2018.11.885zbMath1430.94096OpenAlexW2797087699WikidataQ130008647 ScholiaQ130008647MaRDI QIDQ1747274

Padmapani Seneviratne, Lauren Melcher

Publication date: 4 May 2018

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2018.11.885

zbMATH Keywords

strongly regular graphstwo-weight codesGriesmer boundgeneralized MacDonald codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Related Items (1)

An infinite family of Griesmer quasi-cyclic self-orthogonal codes

Cites Work

• On linear codes which attain the Solomon-Stiffler bound
• Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes
• Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
• New classes of 2-weight cyclic codes
• Weights of linear codes and strongly regular normed spaces
• Design Methods for Maximum Minimum-Distance Error-Correcting Codes
• The Geometry of Two-Weight Codes
• Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)

This page was built for publication: On generalized MacDonald codes