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

DOI10.1016/j.disc.2013.03.023zbMath1281.94099arXiv1203.0728OpenAlexW2744736344WikidataQ56926569 ScholiaQ56926569MaRDI QIDQ389190

Patrick Solé, Carsten Thomassen, R. E. L. Aldred, Adel N. Alahmadi, Romar B. dela 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

matroid theorycycle code of graphsintersecting codesminimal codewords

Mathematics Subject Classification ID

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

Related Items (5)

Counting Hamiltonian cycles in planar triangulations ⋮ On the minimum number of minimal codewords ⋮ Cycles in 5-connected triangulations ⋮ On the maximum number of minimal codewords ⋮ On the number of minimal codewords in codes generated by the adjacency matrix of a graph

Uses Software

• Magma

Cites Work

• Secret sharing schemes from binary linear codes
• Linear intersecting codes
• The Magma algebra system. I: The user language
• The maximum number of minimal codewords in long codes
• Decoding linear block codes for minimizing word error rate (Corresp.)
• Minimal vectors in linear codes
• On the Voronoi neighbor ratio for binary linear block codes
• Covering arrays and intersecting codes
• Intersecting codes and independent families
• Voronoi regions for binary linear block codes
• On the maximum number of cycles in a planar graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

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