Fast algorithms for decoding orthogonal and related codes

Simon N. Litsyn

doi:10.1007/3-540-54522-0_94

Fast algorithms for decoding orthogonal and related codes

Simon N. Litsyn^*

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991
Editors	T. R. N. Rao, Harold F. Mattson, Teo Mora
Publisher	Springer Verlag
Pages	39-47
Number of pages	9
ISBN (Print)	9783540545224
DOIs	https://doi.org/10.1007/3-540-54522-0_94
State	Published - 1991
Event	9th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991 - New Orleans, United States Duration: 7 Oct 1991 → 11 Oct 1991

Publication series

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

Conference

Conference	9th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991
Country/Territory	United States
City	New Orleans
Period	7/10/91 → 11/10/91

Access to Document

10.1007/3-540-54522-0_94

Cite this

Litsyn, S. N. (1991). Fast algorithms for decoding orthogonal and related codes. In T. R. N. Rao, H. F. Mattson, & T. Mora (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991 (pp. 39-47). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 539 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54522-0_94

Litsyn, Simon N. / Fast algorithms for decoding orthogonal and related codes. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991. editor / T. R. N. Rao ; Harold F. Mattson ; Teo Mora. Springer Verlag, 1991. pp. 39-47 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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.}",

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",

}

Litsyn, SN 1991, Fast algorithms for decoding orthogonal and related codes. in TRN Rao, HF Mattson & T Mora (eds), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 539 LNCS, Springer Verlag, pp. 39-47, 9th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991, New Orleans, United States, 7/10/91. https://doi.org/10.1007/3-540-54522-0_94

Fast algorithms for decoding orthogonal and related codes. / Litsyn, Simon N.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991. ed. / T. R. N. Rao; Harold F. Mattson; Teo Mora. Springer Verlag, 1991. p. 39-47 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 539 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Fast algorithms for decoding orthogonal and related codes

AU - Litsyn, Simon N.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3342940485&partnerID=8YFLogxK

U2 - 10.1007/3-540-54522-0_94

DO - 10.1007/3-540-54522-0_94

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:3342940485

SN - 9783540545224

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 39

EP - 47

BT - Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991

A2 - Rao, T. R. N.

A2 - Mattson, Harold F.

A2 - Mora, Teo

PB - Springer Verlag

Y2 - 7 October 1991 through 11 October 1991

ER -

Litsyn SN. Fast algorithms for decoding orthogonal and related codes. In Rao TRN, Mattson HF, Mora T, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991. Springer Verlag. 1991. p. 39-47. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54522-0_94

Fast algorithms for decoding orthogonal and related codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this