N. V. Semakov, V. A. Zinov'ev, “Balanced Codes and Tactical Configurations”, Probl. Peredachi Inf., 5:3 (1969), 28–36; Problems Inform. Transmission, 5:3 (1969), 22

Loading [MathJax]/jax/output/CommonHTML/jax.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, 1969, Volume 5, Issue 3, Pages 28–36 (Mi ppi1808)

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

Balanced Codes and Tactical Configurations

N. V. Semakov, V. A. Zinov'ev

Full-text PDF (663 kB) Citations (18)

Abstract: We consider the general properties of balanced codes with the structure of tactical configurations and prove that the upper bounds for the number of words, which follow from Jonson's estimates, are achieved only for such codes. We give the distribution of distances in complete balanced codes which are isomorphic with Steiner systems and quasi-complete codes which are close to them. We also construct a new family of quasi-complete balanced codes.

Received: 12.04.1968
Revised: 17.04.1969

Bibliographic databases:

UDC: 621.391.15

Language: Russian

Citation: N. V. Semakov, V. A. Zinov'ev, “Balanced Codes and Tactical Configurations”, Probl. Peredachi Inf., 5:3 (1969), 28–36; Problems Inform. Transmission, 5:3 (1969), 22–28

Citation in format AMSBIB

\Bibitem{SemZin69}

\by N.~V.~Semakov, V.~A.~Zinov'ev

\paper Balanced Codes and Tactical Configurations

\jour Probl. Peredachi Inf.

\yr 1969

\vol 5

\issue 3

\pages 28--36

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

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

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

\transl

\jour Problems Inform. Transmission

\yr 1969

\vol 5

\issue 3

\pages 22--28

Linking options:

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

https://www.mathnet.ru/eng/ppi/v5/i3/p28

This publication is cited in the following 18 articles:

L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “On $m$ -near-resolvable block designs and $q$ -ary constant-weight codes”, Problems Inform. Transmission, 54:3 (2018), 245–252
L. A. Bassalygo, V. A. Zinoviev, “Remark on balanced incomplete block designs, near-resolvable block designs, and $q$ -ary constant-weight codes”, Problems Inform. Transmission, 53:1 (2017), 51–54
Gillespie N.I. Praeger Ch.E., “New Characterisations of the Nordstrom-Robinson Codes”, Bull. London Math. Soc., 49:2 (2017), 320–330
V. A. Zinoviev, D. V. Zinoviev, “Generalized Preparata codes and $2$ -resolvable Steiner quadruple systems”, Problems Inform. Transmission, 52:2 (2016), 114–133
I. Yu. Mogil'nykh, “On extending propelinear structures of the Nordstrom–Robinson code to the Hamming code”, Problems Inform. Transmission, 52:3 (2016), 289–298
V. A. Zinoviev, D. V. Zinoviev, “Structure of Steiner triple systems $S(2^m-1,3,2)$ of rank $2^m-m+2$ over $\mathbb F_2$ ”, Problems Inform. Transmission, 49:3 (2013), 232–248
Ostergard P.R.J., “Switching codes and designs”, Discrete Math, 312:3 (2012), 621–632
V. A. Zinoviev, D. V. Zinoviev, “Steiner triple systems $S(2^m-1,3,2)$ of rank $2^m-m+1$ over $\mathbb F_2$ ”, Problems Inform. Transmission, 48:2 (2012), 102–126
Zhu M. Ge G., “4-Gdd(6N)S and Related Optimal Quaternary Constant-Weight Codes”, J. Comb Des., 20:12 (2012), 509–526
V. A. Zinoviev, D. V. Zinoviev, “Steiner systems $S(v,k,k-1)$ : components and rank”, Problems Inform. Transmission, 47:2 (2011), 130–148
V. A. Zinoviev, D. V. Zinoviev, “On one transformation of Steiner quadruple systems $S(v,4,3)$ ”, Problems Inform. Transmission, 45:4 (2009), 317–332
Borges, J, “On non-antipodal binary completely regular codes”, Discrete Mathematics, 308:16 (2008), 3508
V. A. Zinov'ev, D. V. Zinov'ev, “On Resolvability of Steiner Systems $S(v=2^m,4,3)$ of Rank $r\le v-m+1$ over $\mathbb F_2$ ”, Problems Inform. Transmission, 43:1 (2007), 33–47
V. A. Zinov'ev, J. Rifà, “On New Completely Regular $q$ -ary Codes”, Problems Inform. Transmission, 43:2 (2007), 97–112
G. T. Bogdanova, V. A. Zinov'ev, T. J. Todorov, “On the Construction of $q$ -ary Equidistant Codes”, Problems Inform. Transmission, 43:4 (2007), 280–302
V. A. Zinov'ev, D. V. Zinov'ev, “Vasil'ev Codes of Length $n=2^m$ and Doubling of Steiner Systems $S(n,4,3)$ of a Given Rank”, Problems Inform. Transmission, 42:1 (2006), 10–29
V. A. Zinov'ev, D. V. Zinov'ev, “Classification of Steiner Quadruple Systems of Order 16 and of Rank 14”, Problems Inform. Transmission, 42:3 (2006), 217–229
V. A. Zinov'ev, D. V. Zinov'ev, “Classification of Steiner Quadruple Systems of Order 16 and of Rank at Most 13”, Problems Inform. Transmission, 40:4 (2004), 337–355

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

Statistics & downloads:
Abstract page:	632
Full-text PDF :	332

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

Registration to the website

Logotypes