2010
DOI: 10.1109/lcomm.2010.04.091969
|View full text |Cite
|
Sign up to set email alerts
|

Unusual general error locator polynomial for the (23, 12, 7) golay code

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 14 publications
(14 citation statements)
references
References 15 publications
0
14
0
Order By: Relevance
“…. , t. The same proof also holds for any v between 2 and t. A Compared with (13), it is easy to see that the proposed formula (14) avoids computing the inverse polynomials (M(S)/m v (S)) 21 .…”
Section: Modified Chinese Remainder Theoremmentioning
confidence: 67%
See 4 more Smart Citations
“…. , t. The same proof also holds for any v between 2 and t. A Compared with (13), it is easy to see that the proposed formula (14) avoids computing the inverse polynomials (M(S)/m v (S)) 21 .…”
Section: Modified Chinese Remainder Theoremmentioning
confidence: 67%
“…For 1 ≤ v ≤ t, let the polynomial m v (S) and syndrome matrix S(I v , J v ) be as mentioned in Theorem 1 and above, respectively. If m 1 ; ... ; m t ; m modulo n and k 1 ; ... ; k t ; m 2 r modulo n, then by (14), the unified representation of the unknown syndrome S r has the form…”
Section: Improved Methodsmentioning
confidence: 99%
See 3 more Smart Citations