New inequalities for q-ary constant-weight codes

DOI10.1007/S10623-014-9924-XzbMATH Open1335.94107arXiv1212.6453OpenAlexW2068873309MaRDI QIDQ398941FDOQ398941

Authors: Hyun Kwang Kim, Phan Thanh Toan 

Publication date: 18 August 2014

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Title not available (Why is that?)
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Semidefinite Code Bounds Based on Quadruple Distances
• Ternary constant weight codes
• Improved upper bounds on sizes of codes
• Title not available (Why is that?)
• On the Delsarte inequalities
• Delsarte's Linear Programming Bound for Constant-Weight Codes
• Improved Semidefinite Programming Bound on Sizes of Codes
• A simple proof of the Delsarte inequalities
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming

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)