On the maximum number of minimal codewords

DOI10.1016/J.DISC.2021.112510zbMATH Open1476.94059arXiv2010.10762OpenAlexW3126256569MaRDI QIDQ2037586FDOQ2037586

Authors: Sascha Kurz, R. de la Cruz 

Publication date: 8 July 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number are presented. We determine the exact values for the case of linear codes of dimension $k$ and length $k+2$ and for small values of the length and dimension. We also give a formula for the number of minimal codewords of linear codes of dimension $k$ and length $k+3$.

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

Recommendations

• The maximum number of minimal codewords in an \([n,k]\)-code
• On the minimum number of minimal codewords
• scientific article; zbMATH DE number 2143618
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• Bounds for binary codes of length less than 25

zbMATH Keywords

minimal codewordsbounds for codesexact values

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Towards secure two-party computation from the wire-tap channel
• Title not available (Why is that?)
• Minimal vectors in linear codes
• Minimal codewords in Reed-Muller codes
• On the Voronoi neighbor ratio for binary linear block codes
• The maximum number of minimal codewords in long codes
• Title not available (Why is that?)
• Decoding linear block codes for minimizing word error rate (Corresp.)
• The maximum number of minimal codewords in an \([n,k]\)-code
• Title not available (Why is that?)
• Voronoi regions for binary linear block codes
• Secret-sharing with a class of ternary codes
• Title not available (Why is that?)
• The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
• On the minimum number of minimal codewords
• Determination of the Local Weight Distribution of Binary Linear Block Codes

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the minimum number of minimal codewords
• Number of minimal-weight words in block codes
• The maximum number of minimal codewords in long codes
• A min-max theorem for antijamming group codes
• The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
• On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• A minimax method with application to the initial vector coding problem^*
• The maximum number of minimal codewords in an \([n,k]\)-code

This page was built for publication: On the maximum number of minimal codewords

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