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

2012/03/04 by A. Alahmadi, Adel Alahmadi, Alahmadi, A. +11 · 1 citation
Computer Science · Engineering · Mathematics · #05B35 (Secondary) #94A10 (Primary) 05C38 #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.CO #math.IT #msc:05B35 #msc:05C38 #msc:94A10

paper · pdf · doi:10.48550/arxiv.1203.0728

6 pp. Submitted

arxiv created 2012/03/04 · openalex publication_date 2012/03/04 · arxiv updated 2012/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Counting k-cycles in 5-connected planar triangulations

Related

• The maximum number of minimal codewords in long codes
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• Bounds on Codes Based on Graph Theory
• New Upper Bounds on A(n,d)
• On the maximum number of minimal codewords