2018
DOI: 10.1007/978-981-13-0586-3_51
|View full text |Cite
|
Sign up to set email alerts
|

Algorithmic Approach for Error-Correcting Capability and Decoding of Linear Codes Arising from Algebraic Geometry

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Since the invention of Hamming codes in 1950, error correction methods have advanced significantly. In [4][5][6], the authors cover the main designs and constructions of codes from the geometric, algebraic, and graph-theoretic points of view, decoding algorithms. Turbo codes [7,8] low-density parity check codes [9] provide excellent error correction efficiency, but require significant computational costs when working with other encoding and decoding algorithms.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
“…Since the invention of Hamming codes in 1950, error correction methods have advanced significantly. In [4][5][6], the authors cover the main designs and constructions of codes from the geometric, algebraic, and graph-theoretic points of view, decoding algorithms. Turbo codes [7,8] low-density parity check codes [9] provide excellent error correction efficiency, but require significant computational costs when working with other encoding and decoding algorithms.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%