Fast algorithms for decoding orthogonal and related codes

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

Abstract

If we require not a whole spectrum but only its maximal element, we may truncate well-known fast orthogonal transformation algorithms decreasing significantly their complexity. This approach leads to a very simple decoding algorithms which are surveyed in the paper.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991
EditorsT. R. N. Rao, Harold F. Mattson, Teo Mora
PublisherSpringer Verlag
Pages39-47
Number of pages9
ISBN (Print)9783540545224
DOIs
StatePublished - 1991
Event9th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991 - New Orleans, United States
Duration: 7 Oct 199111 Oct 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume539 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991
Country/TerritoryUnited States
CityNew Orleans
Period7/10/9111/10/91

Fingerprint

Dive into the research topics of 'Fast algorithms for decoding orthogonal and related codes'. Together they form a unique fingerprint.

Cite this