Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography

zbMATH Open1183.94057MaRDI QIDQ3621173FDOQ3621173

Authors: Axel Kohnert 

Publication date: 14 April 2009

Full work available at URL: http://x.kerkoje.com/index.php/ajm/article/view/42

Recommendations

• Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
• Recent results and problems on constructions of linear codes from cryptographic functions
• Wide minimal binary linear codes from the general Maiorana-Mcfarland class
• A construction of binary linear codes from Boolean functions
• Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions

zbMATH Keywords

minimum distancecryptographylinear codesprimal dual

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cited In (4)

• Title not available (Why is that?)
• Minimal binary linear codes: a general framework based on bent concatenation
• Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
• A simple combinatorial treatment of constructions and threshold gaps of ramp schemes

This page was built for publication: Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography

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