Construction of two- or three-weight binary linear codes from Vasil'ev codes

DOI10.4134/JKMS.j190429zbMath1495.94108OpenAlexW3166983486MaRDI QIDQ5001883

Jong Yoon Hyun, Jaeseon Kim

Publication date: 23 July 2021

Full work available at URL: https://pdf.medrang.co.kr/kms01/JKMS/58/JKMS-58-1-29-44.pdf

zbMATH Keywords

Grey-Rankin boundfew-weight codesminimal linear codesVasil'ev code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Quasi-symmetric designs and codes meeting the Grey-Rankin bound
• Linear codes from simplicial complexes
• On Minimal and Quasi-minimal Linear Codes
• The Geometry of Two-Weight Codes
• Minimal Binary Linear Codes
• Minimal vectors in linear codes
• Perfect binary codes: constructions, properties, and enumeration
• A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of two- or three-weight binary linear codes from Vasil'ev codes