On algebraic soft decision decoding of cyclic binary codes

V.B. Balakirsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We address a decoding problem for symmetric binary-input memoryless channels when data are transmitted using a cyclic binary code and show that some algebraic methods, like Berlekamp-Massey algorithm, developed for cyclic codes and binary symmetric channels can be effectively used to solve the problem.
Original languageEnglish
Title of host publicationAAECC : applied algebra, algebraic algorithms and error-correcting codes : international conference : proceedings, 14th, Melbourne, Australia, November 26-30, 2001
EditorsS. Bostas, I.E. Shparlinski
Place of PublicationBerlin
PublisherSpringer
Pages315-322
ISBN (Print)978-3-540-42911-1
DOIs
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
Volume2227

Fingerprint

Dive into the research topics of 'On algebraic soft decision decoding of cyclic binary codes'. Together they form a unique fingerprint.

Cite this