Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
331
On the weight distributions of optimal cosets of the first-order Reed-Muller codes
- IEEE Trans. Inform. Theory
, 2001
"... Abstract—We study the weight distributions of cosets of the first-order Reed–Muller code (1) for odd, whose minimum weight is greater than or equal to the so-called quadratic bound. Some general restrictions on the weight distribution of a coset of (1) are obtained by partitioning its words accordin ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract—We study the weight distributions of cosets of the first-order Reed–Muller code (1) for odd, whose minimum weight is greater than or equal to the so-called quadratic bound. Some general restrictions on the weight distribution of a coset of (1) are obtained by partitioning its words
On Cosets of the Generalized First-Order Reed–Muller Code with Low PMEPR
, 2006
"... Golay sequences are well suited for use as codewords in orthogonal frequency-division multiplexing (OFDM) since their peak-to-mean envelope power ratio (PMEPR) in q-ary phase-shift keying (PSK) modulation is at most 2. It is known that a family of polyphase Golay sequences of length 2m organizes in ..."
Abstract
-
Cited by 23 (3 self)
- Add to MetaCart
in m!/2 cosets of a q-ary generalization of the first-order Reed–Muller code, RMq(1, m). In this paper a more general construction technique for cosets of RMq(1, m) with low PMEPR is established. These cosets contain so-called near-complementary sequences. The application of this theory
Simple maximum-likelihood decoding of generalized first-order Reed–Muller codes
- IEEE Commun. Lett
, 2005
"... ..."
Applicable Algebra in Engineering, Communication and Computing 9 Springer-Verlag 1996 Fast Decoding of Non-Binary First Order Reed-Muller Codes
, 1993
"... Abstract. A minimum distance decoding algorithm for non-binary first order Reed-Muller codes is described. Suggested decoding is based on a generalization f the fast Hadamard transform to the non-binary case. We also propose a fast decoding algorithm for non-binary first order Reed-Muller codes with ..."
Abstract
- Add to MetaCart
Abstract. A minimum distance decoding algorithm for non-binary first order Reed-Muller codes is described. Suggested decoding is based on a generalization f the fast Hadamard transform to the non-binary case. We also propose a fast decoding algorithm for non-binary first order Reed-Muller codes
Identifying a class of multiple shift complementary sequences in the second order cosets of the first order Reed-Muller codes
- IEEE International Conference on Communications (ICC
, 2005
"... Abstract — Multiple-shift complementary sequences (MCS), a generalized form of Golay complementary sequences, have re-cently been introduced to encode OFDM signals, allowing a better trade-off between the code rate and peak-to-mean envelope power ratio (PMEPR). However, a table of such sequences nee ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
of the first order Reed-Muller codes. We also present a new proof for the PMEPR of MCS. I.
On the Super Codes of the First Order Reed-Muller Code Based on m-Sequence Pairs
"... Abstract—The super codes of the first order Reed-Muller code are widely used in the practical wireless communication systems, such as WCDMA and LTE. However, the super codes are usually obtained by exhaustive computer search, which involves huge computational cost. Therefore a systematic algorithm t ..."
Abstract
- Add to MetaCart
Abstract—The super codes of the first order Reed-Muller code are widely used in the practical wireless communication systems, such as WCDMA and LTE. However, the super codes are usually obtained by exhaustive computer search, which involves huge computational cost. Therefore a systematic algorithm
A NEW STEGANOGRAPHIC SCHEME BASED ON FIRST ORDER REED MULLER CODES-- A New Steganographic Scheme
, 2011
"... ..."
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers
, 1999
"... The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tuple of vectors is contained in at least one ball of radius t centered at some codeword. In this paper upper bounds are ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
are found for the multicovering radii of first order Reed-Muller codes. These bounds generalize the well-known Norse bounds for the classical covering radii of first order Reed-Muller codes. They are exact in some cases. These bounds are then used to prove the existence of secure families of keystreams
List decoding of Reed-Muller codes
- in "Proceedings of ACCT’9
, 2004
"... We construct list decoding algorithms for first order Reed-Muller codes RM[1, m] of length n = 2m correcting up to n ( 1 2 − ɛ) errors with complexity O(nɛ−3). Considering probabilistic approximation of these algorithms leads to randomized list decoding algorithms with characteristics similar to Gol ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We construct list decoding algorithms for first order Reed-Muller codes RM[1, m] of length n = 2m correcting up to n ( 1 2 − ɛ) errors with complexity O(nɛ−3). Considering probabilistic approximation of these algorithms leads to randomized list decoding algorithms with characteristics similar
A Noise-Adaptive Algorithm for First-Order Reed-Muller Decoding
"... We consider the problem of decoding First-Order Reed-Muller codes efficiently. We give an algorithm that implicitly adapts to the noise conditions, runs significantly faster than known maximum-likelihood algorithms, and yields an error rate that is very close to optimal. When applied to CCK demodul ..."
Abstract
- Add to MetaCart
We consider the problem of decoding First-Order Reed-Muller codes efficiently. We give an algorithm that implicitly adapts to the noise conditions, runs significantly faster than known maximum-likelihood algorithms, and yields an error rate that is very close to optimal. When applied to CCK
Results 1 - 10
of
331
