Minimal binary codewords derived from the incidence-matrix approach

DOI10.1007/S40314-025-03580-6MaRDI QIDQ6852919zbMATH OpenFDO

Authors Boran Kim

Publication date 25 February 2026

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-025-03580-6

zbMATH Keywords

graphslinear codesminimal codewords

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear codes (general theory) (94B05)

Cites work

• Construction of minimal linear codes from multi-variable functions
• Decoding linear block codes for minimizing word error rate (Corresp.)
• scientific article; zbMATH DE number 2143618 (Why is no real title available?)
• Linear codes from weakly regular plateaued functions and their secret sharing schemes
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Minimal codewords over finite fields derived from certain graphs
• Minimal linear codes arising from blocking sets
• Minimal linear codes in odd characteristic
• Minimal vectors in linear codes
• On the minimum number of minimal codewords
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• On the Voronoi neighbor ratio for binary linear block codes
• The maximum number of minimal codewords in an \([n,k]\)-code
• The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
• Three combinatorial perspectives on minimal codes
• Voronoi regions for binary linear block codes

This page was built for publication: Minimal binary codewords derived from the incidence-matrix approach

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