L. A. Bassalygo, S. M. Dodunekov, V. A. Zinov'ev, T. Helleseth, “The Gray–Rankin Bound for Nonbinary Codes”, Probl. Peredachi Inf., 42:3 (2006), 37–44; Problems Inform. Transmission, 42:3 (2006), 197

Loading [MathJax]/jax/output/SVG/config.js

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, 2006, Volume 42, Issue 3, Pages 37–44 (Mi ppi51)

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

Coding Theory

The Gray–Rankin Bound for Nonbinary Codes

L. A. Bassalygo^a, S. M. Dodunekov^b, V. A. Zinov'ev^a, T. Helleseth^c

^a Institute for Information Transmission Problems, Russian Academy of Sciences
^b Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
^c University of Bergen

Full-text PDF (784 kB) Citations (6)

References:

PDF

HTML

Abstract: The Grey–Rankin bound for nonbinary codes is obtained. Examples of codes meeting this bound are given.

Received: 28.02.2006
Revised: 28.04.2006

English version:
Problems of Information Transmission, 2006, Volume 42, Issue 3, Pages 197–203
DOI: https://doi.org/10.1134/S0032946006030033

Bibliographic databases:

Document Type: Article

UDC: 621.391.15

Language: Russian

Citation: L. A. Bassalygo, S. M. Dodunekov, V. A. Zinov'ev, T. Helleseth, “The Gray–Rankin Bound for Nonbinary Codes”, Probl. Peredachi Inf., 42:3 (2006), 37–44; Problems Inform. Transmission, 42:3 (2006), 197–203

Citation in format AMSBIB

\Bibitem{BasDodZin06}

\by L.~A.~Bassalygo, S.~M.~Dodunekov, V.~A.~Zinov'ev, T.~Helleseth

\paper The Gray--Rankin

Bound for Nonbinary Codes

\jour Probl. Peredachi Inf.

\yr 2006

\vol 42

\issue 3

\pages 37--44

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

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

\transl

\jour Problems Inform. Transmission

\yr 2006

\vol 42

\issue 3

\pages 197--203

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

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

Linking options:

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

https://www.mathnet.ru/eng/ppi/v42/i3/p37

This publication is cited in the following 6 articles:

J. Borges, V. A. Zinoviev, D. V. Zinoviev, “On the classification of completely regular codes with covering radius two and antipodal duals”, Problems Inform. Transmission, 59:3 (2023), 204–216
P. Boyvalenkov, K. Delchev, V. A. Zinoviev, D. V. Zinoviev, “On codes with distances $d$ and $n$”, Problems Inform. Transmission, 58:4 (2022), 352–371
Polak S.C., “New Nonbinary Code Bounds Based on Divisibility Arguments”, Designs Codes Cryptogr., 86:4 (2018), 861–874
Chee Y.M., Kiah H.M., Purkayastha P., Sole P., “Product Construction of Affine Codes”, SIAM Discret. Math., 29:3 (2015), 1540–1552
L. A. Bassalygo, V. A. Zinoviev, “Optimal almost equisymbol codes based on difference matrices”, Problems Inform. Transmission, 50:4 (2014), 313–319
A. A. Davydov, V. V. Zyablov, R. E. Kalimullin, “Special sequences as subcodes of Reed–Solomon codes”, Problems Inform. Transmission, 46:4 (2010), 321–345

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

Statistics & downloads:
Abstract page:	513
Full-text PDF :	170
References:	77
First page:	5

Registration to the website

Logotypes