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

Codes from cubic residues

Codes from cubic residues

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.

Following previous work on the development of minimum-distance codes from quadratic residues via Hadamard matrices, cubic residues have been used with the same algorithms. Codes of lengths 16, 32 and 36 have been constructed.

Inspec keywords: codes

Other keywords: cubic residues; codes

Subjects: Codes

References

    1. 1)
      • D.A. Bell , R. Laxton . Some BCH codes are optimum. Electron. Lett. , 296 - 297
    2. 2)
      • A. Brauer . On a new class of Hadamard determinants. Math. Z. , 219 - 225
    3. 3)
      • H.J. Helgert , R.D. Stinaff . Minimum-distance bounds for binary linear codes. IEEE Trans. , 344 - 356
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19770061
Loading

Related content

content/journals/10.1049/el_19770061
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Correspondence
This article has following corresponding article(s):
Codes from cubic residues
This is a required field
Please enter a valid email address