Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography

DOI10.1109/TIT.2006.880050zbMATH Open1320.94093DBLPjournals/tit/MatsumotoKIKU06arXivcs/0506087OpenAlexW2127493213WikidataQ57735122 ScholiaQ57735122MaRDI QIDQ3548016FDOQ3548016

Authors: Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Let $N(d,d^{p}erp)$ denote the minimum length $n$ of a linear code $C$ with $d$ and $$, where $d$ is the minimum Hamming distance of $C$ and $$ is the minimum Hamming distance of $$. In this paper, we show a lower bound and an upper bound on $N(d,d^{p}erp)$. Further, for small values of $d$ and $d^{p}erp$, we determine $N(d,d^{p}erp)$ and give a generator matrix of the optimum linear code. This problem is directly related to the design method of cryptographic Boolean functions suggested by Kurosawa et al.

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

Recommendations

• Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography
• On the distance between linear codes
• Hardness of approximating the minimum distance of a linear code
• The linear programming bound for binary linear codes
• Bounds on spectra of codes with known dual distance
• Multisecret-sharing schemes and bounded distance decoding of linear codes
• On linear programming bounds for codes in polynomial metric spaces
• Binary linear codes with near-extremal maximum distance
• New minimum distance bounds for linear codes over small fields
• scientific article; zbMATH DE number 789825

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cited In (6)

• Boolean functions: degree and support
• Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography
• On the Hamming distance in combinatorial optimization problems on hypergraph matchings
• Estimates of the neighborhood volumes of binary codes via their weight spectra
• A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
• Vectorial resilient \(\mathrm{PC}(l)\) of order \(k\) Boolean functions from AG-codes

This page was built for publication: Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography

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