Topics
cryptanalysisBook
cipherSoftware
2 Application to cryptanalysis Approximation of a bloc cipher 3 Power Analysis attacks overvie
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixe...
Abstract. The q-ary Reed-Muller codes RMq(u, m) of length n = qm are a generalization of Reed-Solomo...
In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of pol...
We construct list decoding algorithms for first order Reed-Muller codes RM [1,m] of length n = 2m co...
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. T...
In this thesis, we study the Reed-Muller codes which constitute one of the classes of error correcti...
The weight distribution and list-decoding size of Reed-Muller codes are studied in this work. Given ...
A new list decoding algorithms for second order Reed-Muller codes RM(2,m) of length n = 2m correctin...
We studied the decoding problem of Reed-Muller codes of order r in different kinds of chanels and in...
AbstractA Reed–Solomon code of length n can be list decoded using the well-known Guruswami–Sudan alg...
A list decoding algorithm is presented for [n, k] Reed-Solomon (RS) codes over GF (q), which is capa...
Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials...
Abstract. An improvement of the Kabatiansky-Tavernier list decoding algorithm for the second order R...
Reed-Muller (RM) codes are classical codes that have enjoyed unabated interest since their introduct...
In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a dista...
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixe...
Abstract. The q-ary Reed-Muller codes RMq(u, m) of length n = qm are a generalization of Reed-Solomo...
In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of pol...
We construct list decoding algorithms for first order Reed-Muller codes RM [1,m] of length n = 2m co...
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. T...
In this thesis, we study the Reed-Muller codes which constitute one of the classes of error correcti...
The weight distribution and list-decoding size of Reed-Muller codes are studied in this work. Given ...
A new list decoding algorithms for second order Reed-Muller codes RM(2,m) of length n = 2m correctin...
We studied the decoding problem of Reed-Muller codes of order r in different kinds of chanels and in...
AbstractA Reed–Solomon code of length n can be list decoded using the well-known Guruswami–Sudan alg...
A list decoding algorithm is presented for [n, k] Reed-Solomon (RS) codes over GF (q), which is capa...
Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials...
Abstract. An improvement of the Kabatiansky-Tavernier list decoding algorithm for the second order R...
Reed-Muller (RM) codes are classical codes that have enjoyed unabated interest since their introduct...
In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a dista...
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixe...
Abstract. The q-ary Reed-Muller codes RMq(u, m) of length n = qm are a generalization of Reed-Solomo...
In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of pol...
Add to ORKG