G. T. Bogdanova, V. A. Zinov'ev, T. J. Todorov, “On the Construction of $q$-ary Equidistant Codes”, Probl. Peredachi Inf., 43:4 (2007), 13–36; Problems Inform. Transmission, 43:4 (2007), 280

Problemy Peredachi Informatsii

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor
	Guidelines for authors

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Problemy Peredachi Informatsii, 2007, Volume 43, Issue 4, Pages 13–36 (Mi ppi24)

This article is cited in 11 scientific papers (total in 11 papers)

Coding Theory

On the Construction of

q

$q$ -ary Equidistant Codes

G. T. Bogdanova^a, V. A. Zinov'ev^b, T. J. Todorov^a

^a Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
^b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

Full-text PDF (2476 kB) Citations (11)

References:

PDF

HTML

Abstract: The problem of constructing equidistant codes over an alphabet of an arbitrary size

q

$q$ is considered. Some combinatorial constructions and computer-based search methods are presented. All maximal equidistant codes with distances 3 and 4 are found.

Received: 19.12.2006
Revised: 03.10.2007

English version:
Problems of Information Transmission, 2007, Volume 43, Issue 4, Pages 280–302
DOI: https://doi.org/10.1134/S0032946007040023

Bibliographic databases:

Document Type: Article

UDC: 621.391.15

Language: Russian

Citation: G. T. Bogdanova, V. A. Zinov'ev, T. J. Todorov, “On the Construction of

q

$q$ -ary Equidistant Codes”, Probl. Peredachi Inf., 43:4 (2007), 13–36; Problems Inform. Transmission, 43:4 (2007), 280–302

Citation in format AMSBIB

\Bibitem{BogZinTod07}

\by G.~T.~Bogdanova, V.~A.~Zinov'ev, T.~J.~Todorov

\paper On the Construction of $q$-ary Equidistant Codes

\jour Probl. Peredachi Inf.

\yr 2007

\vol 43

\issue 4

\pages 13--36

\mathnet{http://mi.mathnet.ru/ppi24}

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2406141}

\zmath{https://zbmath.org/?q=an:05319695}

\elib{https://elibrary.ru/item.asp?id=10022768}

\transl

\jour Problems Inform. Transmission

\yr 2007

\vol 43

\issue 4

\pages 280--302

\crossref{https://doi.org/10.1134/S0032946007040023}

\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000255782900002}

\elib{https://elibrary.ru/item.asp?id=13548226}

\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-45349091114}

Linking options:

https://www.mathnet.ru/eng/ppi24

https://www.mathnet.ru/eng/ppi/v43/i4/p13

This publication is cited in the following 11 articles:

Aida Abiad, Afrouz Jabal Ameli, Luuk Reijnders, “The clique number of the exact distance t-power graph: Complexity and eigenvalue bounds”, Discrete Applied Mathematics, 363 (2025), 55
Galina Bogdanova, Todor Todorov, “Enumeration of Optimal Equidistant Codes”, Mathematics, 10:5 (2022), 740
P. Boyvalenkov, K. Delchev, D. V. Zinoviev, V. A. Zinoviev, “On $q$ -ary codes with two distances $d$ and $d+1$ ”, Problems Inform. Transmission, 56:1 (2020), 33–44
Polak S.C., “New Nonbinary Code Bounds Based on Divisibility Arguments”, Designs Codes Cryptogr., 86:4 (2018), 861–874
Anu Kathuria, S.K. Arora, Sudhir Batra, “On traceability property of equidistant codes”, Discrete Mathematics, 340:4 (2017), 713
Y. L. Borissov, “Some new results on Hadamard modulo prime matrices”, Problems Inform. Transmission, 52:2 (2016), 134–141
Chee Y.M., Kiah H.M., Ling A.C.H., Wang C., “Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes For Power Line Communications”, J. Comb Des., 23:4 (2015), 151–182
D. I. Kovalevskaya, “On metric rigidity for some classes of codes”, Problems Inform. Transmission, 47:1 (2011), 15–27
Bogdanova G.T., Todorov T.J., Todorov V.H., “QPlus: computer package for coding theory research and education”, Int. J. Comput. Math., 88:3 (2011), 443–451
Borges J., Rifà J., Zinoviev V.A., “On $q$ -ary linear completely regular codes with $\rho=2$ and antipodal dual”, Adv. Math. Commun., 4:4 (2010), 567–578
Todor Todorov, Galina Bogdanova, Teodora Yorgova, “Lexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements”, IIM, 02:03 (2010), 183

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	915
Full-text PDF :	147
References:	79
First page:	11

Что такое QR-код?

Registration to the website

Logotypes