On the nonexistence of perfect 2- and 3-Hamming-error-correcting codes over GF(q)

J.H. van Lint

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

10 Citations (Scopus)
54 Downloads (Pure)

Abstract

Abstract only given, substantially as follows. Let p be a prime, q=p/sup a/, F=GF(q) and let V be the vectorspace F/sup N/. For any x epsilon V weight of x is defined to be the number of non-zero components of x. The (Hamming-) distance d(x,y) of 2 vectors x,y of V is defined to be the weight of x-y. If e is a positive integer the sphere B(x,e) is defined by B(x,e):={y epsilon V:d(x,y)
Original languageEnglish
Title of host publicationProgram and abstracts of papers to be presented at the 1970 international symposium on information theory (June 15-19, 1970, Noordwijk, The Netherlands)
Place of PublicationNew York, NY, USA
PublisherInstitute of Electrical and Electronics Engineers
Pages1
Publication statusPublished - 1970

Fingerprint Dive into the research topics of 'On the nonexistence of perfect 2- and 3-Hamming-error-correcting codes over GF(q)'. Together they form a unique fingerprint.

  • Cite this

    van Lint, J. H. (1970). On the nonexistence of perfect 2- and 3-Hamming-error-correcting codes over GF(q). In Program and abstracts of papers to be presented at the 1970 international symposium on information theory (June 15-19, 1970, Noordwijk, The Netherlands) (pp. 1). Institute of Electrical and Electronics Engineers.