On the minimum number of minimal codewords

DOI10.3934/AMC.2020130MaRDI QIDQ6112238zbMATH OpenOpenAlexWikidataFDO

Authors Romar Dela Cruz, Michael Kiermaier, Sascha Kurz, Alfred Wassermann

Publication date 7 July 2023

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

decodinglinear codesminimal codewordsprojective geometrysecret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Abstract: We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.

Recommendations

• On the maximum number of minimal codewords
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• Three combinatorial perspectives on minimal codes
• On minimal and quasi-minimal linear codes
• scientific article; zbMATH DE number 2143618

Cites work

• A geometric characterization of minimal codes and their asymptotic performance
• Decoding linear block codes for minimizing word error rate (Corresp.)
• Determination of the Local Weight Distribution of Binary Linear Block Codes
• Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
• Generalized Hamming weights for linear codes
• Geometric approach to higher weights
• Higher support matroids
• 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 2040937 (Why is no real title available?)
• scientific article; zbMATH DE number 2143618 (Why is no real title available?)
• Minimal codewords in Reed-Muller codes
• Minimal linear codes arising from blocking sets
• Minimal vectors in linear codes
• On the Voronoi neighbor ratio for binary linear block codes
• Secret-sharing with a class of ternary codes
• The maximum number of minimal codewords in an \([n,k]\)-code
• The maximum number of minimal codewords in long codes
• The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
• The packing problem in statistics, coding theory and finite projective spaces
• Towards secure two-party computation from the wire-tap channel
• Voronoi regions for binary linear block codes
• Weight enumeration of codes from finite spaces

Cited in

(10)

• Number of minimal-weight words in block codes
• 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
• scientific article; zbMATH DE number 4074967 (Why is no real title available?)
• The maximum number of minimal codewords in an \([n,k]\)-code
• Three combinatorial perspectives on minimal codes
• On the lower bound for the length of minimal codes
• Minimal binary codewords derived from the incidence-matrix approach
• Minimal codewords over finite fields derived from certain graphs

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

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