B. I. Belov, V. N. Logachev, V. P. Sandimirov, “Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound”, Probl. Peredachi Inf., 10:3 (1974), 36

RUS ENG

JOURNALS PERSONS ORGANISATIONS CONFERENCES VIDEO LIBRARY PERSONAL OFFICE LIBRARY

	General information
	Latest issue
	Archive
	Impact factor

	Search
	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

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

Search through the site:

Find

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

Probl. Peredachi Inf., 1974, Volume 10, Issue 3, Pages 36–44 (Mi ppi1040)

This article is cited in 2 papers

Coding Theory

PDF version

HTML version

Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound

B. I. Belov, V. N. Logachev, V. P. Sandimirov

Abstract: A class of optimal (in the sense of achieving the Varshamov–Griesmer bound) linear binary codes is described; it is strictly included in the class of Solomon–Stiffler codes. A subclass of the given class of codes is constructively defined for the case of relatively small code distances.

UDC: 621.391.15

Received: 13.02.1973
Revised: 19.02.1974

Citation: B. I. Belov, V. N. Logachev, V. P. Sandimirov, “Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound”, Probl. Peredachi Inf., 10:3 (1974), 36–44

Citation in format AMSBIB:

\Bibitem{1}
\by B.~I.~Belov, V.~N.~Logachev, V.~P.~Sandimirov
\paper Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound
\jour Probl. Peredachi Inf.
\yr 1974
\vol 10
\issue 3
\pages 36--44
\mathnet{http://mi.mathnet.ru/ppi1040}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=469488}
\zmath{http://www.zentralblatt-math.org/zmath/search/?an=Zbl 0317.94014}
\transl
\jour Problems Inform. Transmission
\yr 1974
\vol 10
\issue 3
\pages 211--217

Linking options:

http://mi.mathnet.ru/eng/ppi1040

http://mi.mathnet.ru/eng/ppi/v10/i3/p36

Full-text article is available

Full text (in Russian): PDF file (911 kB)

English version:
Problems of Information Transmission, 1974, 10:3, 211–217

Review databases:

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

This publication is cited in the following articles:

Х. Гриссер, В. Р. Сидоренко, “Апостериорно-вероятностное декодирование несистематических блоковых кодов”, Пробл. передачи информ., 38:3 (2002), 20–33 ; H. Grießer, V. R. Sidorenko, “A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes”, Problems Inform. Transmission, 38:3 (2002), 182–193
Landjev, I, “A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound”, DESIGNS CODES AND CRYPTOGRAPHY, 45:1 (2007), 123

Number of views:
This page:	96
Full text:	27

Registration