The maximum number of minimal codewords in an [n,k]-code

DOI10.1016/J.DISC.2013.03.023MaRDI QIDQ389190zbMATH OpenOpenAlexWikidataFDO

Authors R. E. L. Aldred, Patrick Solé, Carsten Thomassen, Adel Alahmadi, R. de la Cruz

Publication date 17 January 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.0728

zbMATH Keywords

cycle code of graphsintersecting codesmatroid theoryminimal codewords

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Other types of codes (94B60)

Abstract: Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.

Recommendations

• The maximum number of minimal codewords in long codes
• On the maximum number of minimal codewords
• A new upper bound for binary codes with minimum distance four
• The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
• On the minimum number of minimal codewords

Cites work

• Covering arrays and intersecting codes
• Decoding linear block codes for minimizing word error rate (Corresp.)
• scientific article; zbMATH DE number 5138821 (Why is no real title available?)
• scientific article; zbMATH DE number 3735858 (Why is no real title available?)
• scientific article; zbMATH DE number 1057740 (Why is no real title available?)
• Intersecting codes and independent families
• Linear intersecting codes
• Minimal vectors in linear codes
• On the maximum number of cycles in a planar graph
• On the Voronoi neighbor ratio for binary linear block codes
• Secret sharing schemes from binary linear codes
• The Magma algebra system. I: The user language
• The maximum number of minimal codewords in long codes
• Voronoi regions for binary linear block codes

Cited in

(12)

• Number of minimal-weight words in block codes
• Maximality of the cycle code of a graph
• The maximum number of minimal codewords in long codes
• On the maximum number of minimal codewords
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• Counting Hamiltonian cycles in planar triangulations
• Cycles in 5-connected triangulations
• The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
• scientific article; zbMATH DE number 3880583 (Why is no real title available?)
• On the minimum number of minimal codewords
• Minimal binary codewords derived from the incidence-matrix approach
• Minimal codewords over finite fields derived from certain graphs

Describes a project that uses

Uses Software

• Magma

This page was built for publication: The maximum number of minimal codewords in an \([n,k]\)-code

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