On q-ary codes with two distances d and d+1

DOI10.1134/S0032946020010044zbMATH Open1473.94134arXiv1906.09645MaRDI QIDQ2190983FDOQ2190983

Authors: Dmitrii Zinoviev, Peter Boyvalenkov, Konstantin Delchev, Victor A. Zinoviev 

Publication date: 23 June 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

Abstract: The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes is derived. Tables of lower and upper bounds for small $q$ and $n$ are presented.

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

Recommendations

• On codes with distances \(d\) and \(n\)
• On two-weight codes
• On the Maximal Cardinality of Binary Two-weight Codes
• On the construction of \(q\)-ary equidistant codes
• Constructions of binary codes with two distances

zbMATH Keywords

equidistant codesbounds for codestwo-distance codes

Mathematics Subject Classification ID

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

Cites Work

• The Geometry of Two-Weight Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• Title not available (Why is that?)
• On the construction of \(q\)-ary equidistant codes
• On Two-Distance Sets in Euclidean Space
• Title not available (Why is that?)
• Bounds on sets with few distances
• Title not available (Why is that?)
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• On completely regular codes
• On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
• On Linear Codes of Almost Constant Weight and the Related Arcs

Cited In (9)

• On codes with distances \(d\) and \(n\)
• Code distances of some classes of \((p,p)\)-codes
• Codes that attain minimum distance in every possible direction
• On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
• On the construction of \(q\)-ary equidistant codes
• On the Maximal Cardinality of Binary Two-weight Codes
• On two-weight codes
• Upper bounds for the cardinality of s-distances codes
• On the classification of completely regular codes with covering radius two and antipodal duals

This page was built for publication: On \(q\)-ary codes with two distances \(d\) and \(d+1\)

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