New inequalities for q-ary constant-weight codes

DOI10.1007/S10623-014-9924-XMaRDI QIDQ398941zbMATHOpenAlexFDO

Authors Hyun Kwang Kim, Phan Thanh Toan

Publication date 18 August 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingbinary code\(q\)-ary codeDelsarte inequalities

Mathematics Subject Classification ID

Bounds on codes (94B65)

Abstract: Using double counting, we prove Delsarte inequalities for $q$-ary codes and their improvements. Applying the same technique to $q$-ary constant-weight codes, we obtain new inequalities for $q$-ary constant-weight codes.

Cites work

• scientific article; zbMATH DE number 3167429 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A simple proof of the Delsarte inequalities
• Delsarte's Linear Programming Bound for Constant-Weight Codes
• Fundamentals of Error-Correcting Codes
• Improved Semidefinite Programming Bound on Sizes of Codes
• Improved upper bounds on sizes of codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• On the Delsarte inequalities
• Semidefinite Code Bounds Based on Quadruple Distances
• Ternary constant weight codes

Cited in

(1)

• A new construction for \(q\)-ary constant weight codes

This page was built for publication: New inequalities for \(q\)-ary constant-weight codes

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