Improved linear programming bound on sizes of doubly constant-weight codes

DOI10.1016/j.ffa.2018.08.009zbMath1401.94257OpenAlexW2889133487MaRDI QIDQ1800703

Hyun Kwang Kim, Jaeseon Kim, Phan Thanh Toan

Publication date: 24 October 2018

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2018.08.009

zbMATH Keywords

linear programmingupper boundbinary codedoubly constant-weight code

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65)

Related Items (1)

On the Construction of Multiply Constant-Weight Codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New upper bounds on codes via association schemes and linear programming
• Upper bounds for constant weight error correcting codes
• Coding for tolerance and detection of skew in parallel asynchronous communications
• Upper bounds for constant-weight codes
• New Bounds and Constructions for Multiply Constant-Weight Codes
• Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
• Delsarte's Linear Programming Bound for Constant-Weight Codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Optical orthogonal codes: design, analysis and applications
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Bounds for binary codes of length less than 25
• On the undetected error probability of nonlinear binary constant weight codes
• Semidefinite Programming Bounds for Constant-Weight Codes
• Semidefinite Code Bounds Based on Quadruple Distances
• Improved Semidefinite Programming Bound on Sizes of Codes

This page was built for publication: Improved linear programming bound on sizes of doubly constant-weight codes