Results 1  10
of
3,172
ON THE SECONDORDER REED–MULLER CODE1
, 2002
"... Dedicated to the 75th birthday of István Reiman In this paper we shall give a recursion and a new explicite formula for some functions connected with the weight distribution of the secondorder Reed–Muller code. We define some new subcodes of it and determine their information rates, respectively. ..."
Abstract
 Add to MetaCart
Dedicated to the 75th birthday of István Reiman In this paper we shall give a recursion and a new explicite formula for some functions connected with the weight distribution of the secondorder Reed–Muller code. We define some new subcodes of it and determine their information rates, respectively.
List decoding of second order ReedMuller codes
 In : Proceedings of the Eighteen International Symposium of Communication Theory and Applications, Ambleside
, 2005
"... A new list decoding algorithms for second order ReedMuller codes RM(2,m) of length n = 2m correcting far beyond minimal distance is proposed. In order to prove polynomial complexity of the algorithm we derive an improvement of well known Johnson bound. Key words: list decoding, complexity, ReedMul ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
A new list decoding algorithms for second order ReedMuller codes RM(2,m) of length n = 2m correcting far beyond minimal distance is proposed. In order to prove polynomial complexity of the algorithm we derive an improvement of well known Johnson bound. Key words: list decoding, complexity, ReedMuller
A fast reconstruction algorithm for deterministic compressive sensing using second order ReedMuller codes
 Conference on Information Sciences and Systems (CISS), Princeton, ISBN: 9781424422463, pp: 11  15
, 2008
"... Abstract—This paper proposes a deterministic compressed sensing matrix that comes by design with a very fast reconstruction algorithm, in the sense that its complexity depends only on the number of measurements n and not on the signal dimension N. The matrix construction is based on the second order ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
order ReedMuller codes and associated functions. This matrix does not have RIP uniformly with respect to all ksparse vectors, but it acts as a near isometry on ksparse vectors with very high probability. I.
List Decoding of Second Order ReedMuller Codes and its Covering Radius Implications
"... Abstract. An improvement of the KabatianskyTavernier list decoding algorithm for the second order ReedMuller code RM(2,m), of length n = 2m, and a better evaluation of its complexity (with a gain of a factor n) are proposed. We give a new bound for this complexity and conjecture a better bound whi ..."
Abstract
 Add to MetaCart
Abstract. An improvement of the KabatianskyTavernier list decoding algorithm for the second order ReedMuller code RM(2,m), of length n = 2m, and a better evaluation of its complexity (with a gain of a factor n) are proposed. We give a new bound for this complexity and conjecture a better bound
A linear construction for certain Kerdock and Preparata codes
 Bull. Amer. Math. Soc
, 1993
"... codes are shown to be linear over Z4, the integers mod 4. The Kerdock and Preparata codes are duals over Z4, and the NordstromRobinson code is selfdual. All these codes are just extended cyclic codes over Z4. This provides a simple definition for these codes and explains why their Hamming weight d ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
distributions are dual to each other. First and secondorder ReedMuller codes are also linear codes over Z4, but Hamming codes in general are not, nor is the Golay code. 1.
The Z_4linearity of Kerdock, Preparata, Goethals, and related codes
, 2001
"... Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by NordstromRobinson, Kerdock, Preparata, Goethals, and DelsarteGoethals. It is shown here that all these codes can be very simply constructed as binary images under the ..."
Abstract

Cited by 178 (15 self)
 Add to MetaCart
are extended cyclic codes over ¡ 4, which greatly simplifies encoding and decoding. An algebraic harddecision decoding algorithm is given for the ‘Preparata ’ code and a Hadamardtransform softdecision decoding algorithm for the Kerdock code. Binary first and secondorder ReedMuller codes are also linear
Lowdegree tests at large distances
, 2006
"... We define tests of boolean functions which distinguish between linear (or quadratic)polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal tradeoffs between soundness and the number of queries. In particular, we show ..."
Abstract

Cited by 48 (2 self)
 Add to MetaCart
coding theory application. It is possible to estimate efficiently the distance from the secondorder ReedMuller code on inputs lying far beyond its listdecoding radius.
Coding of short control frames for UMTS mobile communication
"... Coding of short Control frames have gained more attention on the field of mobile communication. In recent mobile systems, very different services, channel data rates and formats are in use, especially in the 3 rd Generation Mobile Phone UMTS/3GPP. For this reason many transport channels are introduc ..."
Abstract
 Add to MetaCart
for the composition of the traffic data. Therefore they have to be carefully protected. We investigate in this paper the performance of a correction scheme using a block product code based on bAdjacent code and compare the results in terms of frame error rate with those obtained by using a shortened second order
Best Quadratic Approximations of Cubic Boolean Functions
, 2007
"... The problem of computing best low order approximations of Boolean functions is treated in this paper. We focus on the case of best quadratic approximations of a wide class of cubic functions of arbitrary number of variables, and provide formulas for their efficient calculation. Our methodology is ..."
Abstract
 Add to MetaCart
functions, and cubic functions that achieve the maximum possible nonquadricity are determined, leading to a lower bound for the covering radius of second order ReedMuller code R(2, n) in R(3, n).
Intersections of Golay codes with higher order Kerdock codes
, 1999
"... Golay codewords are useful for transmission schemes such as OFDM, and [MacWilliams/Sloane] demonstrated that these codewords are bent functions contained in second order ReedMuller codes. This paper investigates the intersection between these codes and Kerdocklike codes. 1 1 Introduction 1.1 Pur ..."
Abstract
 Add to MetaCart
Golay codewords are useful for transmission schemes such as OFDM, and [MacWilliams/Sloane] demonstrated that these codewords are bent functions contained in second order ReedMuller codes. This paper investigates the intersection between these codes and Kerdocklike codes. 1 1 Introduction 1
Results 1  10
of
3,172