Skip to main content
SpringerLink
Log in
Book cover

Operations Research and Discrete Analysis pp 301–309Cite as

Spectral Properties of Perfect Binary (n,3)-Codes

  • Chapter

  • 316 Accesses

Part of the book series: Mathematics and Its Applications ((MAIA,volume 391))

Abstract

For an arbitrary perfect binary (n, 3)-code, the distribution is considered of code vertices over the members of a partition of the n -dimensional unit cube. Emphasis is made on the case concerning the set of parallel faces of the same dimension. The face structure of the code complemention is investigated, and, in terms of the result, two characteristic properties of nonlinear codes are established.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. S. Shapiro and D. L. Slotnick (1959) On the mathematical theory of error correcting codes, IBM J. Res. Develop. 3, No. 1, 25–34.

    Article  MathSciNet  Google Scholar 

  2. F. J. Mac Williams and N. J. A. Sloane (1977) The Theory of Error-Correct ing Codes. Vol. 1 and 2, North-Holland Publishing Co., Amsterdam, New York, and Oxford.

    Google Scholar 

  3. P. Delsarte (1972) Bounds for unrestricted codes by linear programming, Phil ips Res. Reports 27, pp. 272–289.

    MathSciNet  MATH  Google Scholar 

  4. A. K. Pulatov (1976) On the structure of close-packed (n, 3)-codes (in Russian), Metody Diskret. Anal. 29, 53–60.

    MathSciNet  MATH  Google Scholar 

  5. A. M. Romanov (1983) Estimate of the length of the shortest disjunctive normal form for the negation of the characteristic function of the Hamming code (in Russian), Metody Diskret. Anal. 39, 88–97.

    MathSciNet  MATH  Google Scholar 

  6. I. G. Petrovskiĭ (1964) Lectures on the Theory of Ordinary Differential Equations, Nauka, Moscow.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, ul. Pirogova, 2, Novosibirsk, 630090, Russia

    A. Yu. Vasil’eva

Authors
  1. A. Yu. Vasil’eva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Vasil’eva, A.Y. (1997). Spectral Properties of Perfect Binary (n,3)-Codes. In: Operations Research and Discrete Analysis. Mathematics and Its Applications, vol 391. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5678-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5678-3_22

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6395-1

  • Online ISBN: 978-94-011-5678-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation