http://iet.metastore.ingenta.com
1887

Some BCH codes are optimum

Some BCH codes are optimum

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

It is shown that some BCH codes are optimum.

Inspec keywords: codes

Other keywords: optimum BCH codes

Subjects: Codes

References

    1. 1)
      • A. Tietäväinen , A. Perko . There are no unknown perfect binary codes. Ann. Univ. Turku. Al.
    2. 2)
      • P. Hammond , D.H. Smith . , Perfect codes in the graphs .
    3. 3)
      • H.J. Helgert , R.D. Stinaff . Minimum distance bounds for binary linear codes. IEEE Trans. , 344 - 356
    4. 4)
      • D.A. Bell . Walsh functions and Hadamard matrixes. Electron. Lett. , 340 - 341
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19750224
Loading

Related content

content/journals/10.1049/el_19750224
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address