Publication:

On the decoding complexity of cyclic codes up to the BCH bound

Date

Date

Date
2011
Book Section
Published version

Citations

Citation copied

Schipani, D., Elia, M., & Rosenthal, J. (2011). On the decoding complexity of cyclic codes up to the BCH bound. In IEEE (Ed.), IEEE International Symposium on Information Theory proceedings (ISIT), 2011 : July 31, 2011 - Aug. 5, 2011, St. Petersburg, Russia (pp. 835–839). IEEE. https://doi.org/10.1109/ISIT.2011.6034253

Abstract

Abstract

Abstract

The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound δ = 2t + 1 is very efficient and practical for relatively small n while it becomes unpractical for large n as its computational complexity is O(nt). Aim of this paper is to show how to make this algebraic decoding computationally more efficient: in the case of binary codes, for example, the complexity of the syndrome computation drops from O(nt) to O(t√n), while the average complexity of the error location drops from O(nt) to max{O(t√n), O(t log2(t

Metrics

Views

129 since deposited on 2012-01-14
128last week
Acq. date: 2025-11-12

Additional indexing

Creators (Authors)

  • Schipani, D
    affiliation.icon.alt
  • Elia, M
    affiliation.icon.alt
  • Rosenthal, J
    affiliation.icon.alt

Editors

  • IEEE

Title of Book

Title of Book

Title of Book
IEEE International Symposium on Information Theory proceedings (ISIT), 2011 : July 31, 2011 - Aug. 5, 2011, St. Petersburg, Russia

Place of Publication

Place of Publication

Place of Publication
Piscataway, NJ, US

Publisher

Publisher

Publisher
IEEE

Page range/Item number

Page range/Item number

Page range/Item number
835

Page end

Page end

Page end
839

Item Type

Item Type

Item Type
Book Section

Dewey Decimal Classifikation

Dewey Decimal Classifikation

Dewey Decimal Classifikation

Language

Language

Language
English

Publication date

Publication date

Publication date
2011

Date available

Date available

Date available
2012-01-14

ISBN or e-ISBN

ISBN or e-ISBN

ISBN or e-ISBN
978-1-4577-0596-0 (P) 978-1-4577-0594-6 (E)

Additional Information

Additional Information

Additional Information
Kongresstagungsband: IEEE International Symposium on Information Theory ; (St. Petersburg) : 2011.07.31-08.05 / ISIT ; (St. Petersburg) : 2011.07.31-08.05

OA Status

OA Status

OA Status
Closed

Metrics

Views

129 since deposited on 2012-01-14
128last week
Acq. date: 2025-11-12

Citations

Citation copied

Schipani, D., Elia, M., & Rosenthal, J. (2011). On the decoding complexity of cyclic codes up to the BCH bound. In IEEE (Ed.), IEEE International Symposium on Information Theory proceedings (ISIT), 2011 : July 31, 2011 - Aug. 5, 2011, St. Petersburg, Russia (pp. 835–839). IEEE. https://doi.org/10.1109/ISIT.2011.6034253

Closed
Loading...
Thumbnail Image

Permanent URL

Permanent URL

Permanent URL
No files available