Easily decodable efficient self-orthogonal block codes

Access Full Text

Easily decodable efficient self-orthogonal block codes

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

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

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.

© The Institution of Electrical Engineers
Published

A class of self-orthogonal block codes is described, which are easy to decode and to augments. They are constructed by forming parity-check equations across certain patterns of information digits arranged in a 2-dimensional array. The codes are of a rate close to the optimum for self-othogonal codes.

Inspec keywords: codes

Other keywords: parity check equations; self orthogonal block codes

Subjects: Codes

References

    1. 1)
      • R.L. Townsend , Weldon , E.J. Jun . Self-orthogonal quasi cyclic codes. IEEE Trans. , 183 - 195
    2. 2)
      • J.L. Massey . (1963) , Threshold decoding.
    3. 3)
      • M. Kasahara , Y. Sugiyama , S. Hirasawa , T. Namekawa . New classes of binary codes constructed on the basis of concatenated codes and product codes. IEEE Trans. , 462 - 467
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19770127
Loading

Related content

content/journals/10.1049/el_19770127
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading