Some restrictions on distance distribution of optimal binary codes

Kovalov, Sergei I.

doi:10.1007/3-540-57843-9_25

Sergei I. Kovalov¹

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 781))

Included in the following conference series:

Workshop on Algebraic Coding

142 Accesses

Abstract

Some new restrictions on the last element of a distance spectrum for optimal binary block codes are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1976.
Google Scholar
F.Harary. Graph Theory. Addison-Wesley. 1969.
Google Scholar

Download references

Author information

Authors and Affiliations

St. Petersburg Academy of Airspace Instrumentation, Bolshaia Morskaia str.,67, 190000, St.-Petersburg, Russia
Sergei I. Kovalov

Authors

Sergei I. Kovalov
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

G. Cohen S. Litsyn A. Lobstein G. Zémor

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Kovalov, S.I. (1994). Some restrictions on distance distribution of optimal binary codes. In: Cohen, G., Litsyn, S., Lobstein, A., Zémor, G. (eds) Algebraic Coding. Algebraic Coding 1993. Lecture Notes in Computer Science, vol 781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57843-9_25

Download citation

DOI: https://doi.org/10.1007/3-540-57843-9_25
Published: 28 May 2005
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57843-7
Online ISBN: 978-3-540-48357-1
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics