The maximum number of minimal codewords in long codes
From MaRDI portal
Publication:1932464
DOI10.1016/j.dam.2012.09.009zbMath1254.05084DBLPjournals/dam/AlahmadiACST13arXiv1201.6043OpenAlexW2027327116WikidataQ56926574 ScholiaQ56926574MaRDI QIDQ1932464
Carsten Thomassen, Patrick Solé, Adel N. Alahmadi, Romar B. dela Cruz, R. E. L. Aldred
Publication date: 18 January 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.6043
Extremal problems in graph theory (05C35) Linear codes (general theory) (94B05) Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (7)
Counting Hamiltonian cycles in planar triangulations ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ 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 ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes]
This page was built for publication: The maximum number of minimal codewords in long codes
