Add to ORKGWe construct list decoding algorithms for first order Reed-Muller codes RM [1,m] of length n = 2m correcting up to n(12 − ǫ) errors with complexity O(nǫ −3). Consid-ering probabilistic approximation of these algorithms leads to randomized list de-coding algorithms with characteristics similar to Goldreich-Levin algorithm, namely, of complexity O(m2ǫ−7 log 1ǫ (lo
In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based ...
Abstract—The q-ary Reed–Muller (RM) codes RM (u;m) of length n = q are a generalization of Reed–Solo...
A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permu...
A new list decoding algorithms for second order Reed-Muller codes RM(2,m) of length n = 2m correctin...
Coding theory has played a central role in the development of computer science. One critical point o...
Abstract. The q-ary Reed-Muller codes RMq(u, m) of length n = qm are a generalization of Reed-Solomo...
Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates...
Abstract—A list decoding algorithm is designed for the first-order binary Reed–Muller codes of lengt...
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixe...
Abstract. An improvement of the Kabatiansky-Tavernier list decoding algorithm for the second order R...
Reed-Muller (RM) codes of growing length n and distance d are considered over a binary symmetric cha...
AbstractA Reed–Solomon code of length n can be list decoded using the well-known Guruswami–Sudan alg...
The weight distribution and list-decoding size of Reed-Muller codes are studied in this work. Given ...
In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a dista...
Recently, Wu proposed in [24] a new approach to list decoding Reed-Solomon codes, quite different fr...
In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based ...
Abstract—The q-ary Reed–Muller (RM) codes RM (u;m) of length n = q are a generalization of Reed–Solo...
A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permu...
A new list decoding algorithms for second order Reed-Muller codes RM(2,m) of length n = 2m correctin...
Coding theory has played a central role in the development of computer science. One critical point o...
Abstract. The q-ary Reed-Muller codes RMq(u, m) of length n = qm are a generalization of Reed-Solomo...
Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates...
Abstract—A list decoding algorithm is designed for the first-order binary Reed–Muller codes of lengt...
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixe...
Abstract. An improvement of the Kabatiansky-Tavernier list decoding algorithm for the second order R...
Reed-Muller (RM) codes of growing length n and distance d are considered over a binary symmetric cha...
AbstractA Reed–Solomon code of length n can be list decoded using the well-known Guruswami–Sudan alg...
The weight distribution and list-decoding size of Reed-Muller codes are studied in this work. Given ...
In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a dista...
Recently, Wu proposed in [24] a new approach to list decoding Reed-Solomon codes, quite different fr...
In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based ...
Abstract—The q-ary Reed–Muller (RM) codes RM (u;m) of length n = q are a generalization of Reed–Solo...
A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permu...