@inproceedings{7419ed39968c40f1aff908cac47acaac,
title = "Fast algorithms for decoding orthogonal and related codes",
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.",
author = "Litsyn, {Simon N.}",
note = "Publisher Copyright: {\textcopyright} 1991, Springer Verlag. All rights reserved.; 9th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991 ; Conference date: 07-10-1991 Through 11-10-1991",
year = "1991",
doi = "10.1007/3-540-54522-0_94",
language = "אנגלית",
isbn = "9783540545224",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "39--47",
editor = "Rao, {T. R. N.} and Mattson, {Harold F.} and Teo Mora",
booktitle = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991",
address = "גרמניה",
}