On Complexity of Decoding Binary Cyclic Codes Using Covering Polynomials

On Complexity of Decoding Binary Cyclic Codes Using Covering Polynomials
Author :
Publisher :
Total Pages : 290
Release :
ISBN-10 : UOM:39015041793061
ISBN-13 :
Rating : 4/5 (61 Downloads)

Book Synopsis On Complexity of Decoding Binary Cyclic Codes Using Covering Polynomials by : Wonjin Sung

Download or read book On Complexity of Decoding Binary Cyclic Codes Using Covering Polynomials written by Wonjin Sung and published by . This book was released on 1995 with total page 290 pages. Available in PDF, EPUB and Kindle. Book excerpt:


On Complexity of Decoding Binary Cyclic Codes Using Covering Polynomials Related Books

On Complexity of Decoding Binary Cyclic Codes Using Covering Polynomials
Language: en
Pages: 290
Authors: Wonjin Sung
Categories:
Type: BOOK - Published: 1995 - Publisher:

DOWNLOAD EBOOK

Algebraic Algorithms and Error-Correcting Codes
Language: en
Pages: 430
Authors: Jaques Calmet
Categories: Computers
Type: BOOK - Published: 1986-07 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Proceedings
Language: en
Pages: 540
Authors:
Categories: Information theory
Type: BOOK - Published: 1994 - Publisher:

DOWNLOAD EBOOK

Algorithmic Complexity and Telecommunication Problems
Language: en
Pages: 277
Authors: J-P Barthelmy
Categories: Computers
Type: BOOK - Published: 2020-08-13 - Publisher: CRC Press

DOWNLOAD EBOOK

In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is
ENCODING AND DECODING CYCLIC CODE GROUPS.
Language: en
Pages: 24
Authors: Norman Abramson
Categories:
Type: BOOK - Published: 1969 - Publisher:

DOWNLOAD EBOOK

It is shown that the product of two cyclic codes with block lengths relatively prime can be described in terms of two interlaced codes. An improved characteriza