The separation of binary relative three-weight codes and its applications

DOI10.1007/s12095-018-0339-9zbMath1419.94066OpenAlexW2900515880WikidataQ128929516 ScholiaQ128929516MaRDI QIDQ2325297

Ying Gao, Yiwei Liu, Zi-Hui Liu

Publication date: 25 September 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0339-9

zbMATH Keywords

trellis complexityseparating propertyminimal codewordsrelative constant-weight code

Mathematics Subject Classification ID

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

Related Items (2)

Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions ⋮ A family of linear codes from constant dimension subspace codes

Cites Work

• Trellis complexity and pseudoredundancy of relative two-weight codes
• The weight distributions of two classes of \(p\)-ary cyclic codes with few weights
• Linear intersecting codes
• Completely separating systems
• Minimal linear codes over finite fields
• Intersecting codes and separating codes
• On relative constant-weight codes
• Coset codes. II. Binary lattices and related codes
• Maximum-likelihood soft decision decoding of BCH codes
• The weight hierarchies of q-ary codes of dimension 4
• More on (2,2)-separating systems
• Minimal Binary Linear Codes
• Minimal vectors in linear codes
• On the trellis complexity of certain binary linear block codes
• Intersecting codes and independent families

This page was built for publication: The separation of binary relative three-weight codes and its applications