Results 1  10
of
17
The NordstromRobinson code is the binary image of the octacode
 Proceedings DIMACS/IEEE Workshop on Coding and
, 1992
"... The NordstromRobinson code, a nonlinear binary code of length 16 and minimal Hamming distance 6, is the binary image of the octacode, a linear selfdual code over 4 of length 8 and minimal Lee distance 6. Since the octacode is the 4analogue of a Hamming code, this ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
The NordstromRobinson code, a nonlinear binary code of length 16 and minimal Hamming distance 6, is the binary image of the octacode, a linear selfdual code over 4 of length 8 and minimal Lee distance 6. Since the octacode is the 4analogue of a Hamming code, this
NordstromRobinson code and A_7geometry
, 2004
"... The NordstromRobinson code NR is a nonlinear binary code of length 16, with 2^8 codewords and minimum distance 6. Its automorphism group is a semidirect product of an elementary abelian group of order 16 and the alternating group A_7 . This group and the corresponding action of A_7 is also at t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The NordstromRobinson code NR is a nonlinear binary code of length 16, with 2^8 codewords and minimum distance 6. Its automorphism group is a semidirect product of an elementary abelian group of order 16 and the alternating group A_7 . This group and the corresponding action of A_7 is also
Some nonregular designs from the Nordstrom–Robinson code and their statistical properties
, 2005
"... ..."
Construction of a (64, 2 , 12) Code via Galois Rings
, 1997
"... Certain nonlinear binary codes contain more codewords than any comparable linear code presently known. These include the Kerdock and Preparata codes, which exist for all lengths 4 16. At length 16 they coincide to give the NordstromRobinson code. This paper constructs a nonlinear (64, 2 , 12) ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Certain nonlinear binary codes contain more codewords than any comparable linear code presently known. These include the Kerdock and Preparata codes, which exist for all lengths 4 16. At length 16 they coincide to give the NordstromRobinson code. This paper constructs a nonlinear (64, 2 , 12
L ReedMuller, NordstromRobinson, or Hamming
"... AbstractLet 8 be a code of length n over a field F, with automorphism group G; 8, denotes the subset of codewords of weight w. Our goal is to classify the vectors of IF " into orbits under G and to determine their distances from the various subcodes 8,. We do this for the firstorder ReedMull ..."
Abstract
 Add to MetaCart
Muller, NordstromRobinson, and Hamming codes of length 16, the Golay and shortened Golay codes of lengths 22, 23, 24, and the ternary Golay code of length 12.
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
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
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
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
unknown title
"... This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as Ndimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes ..."
Abstract
 Add to MetaCart
over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the wellknown nonlinear NordstromRobinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed
LDPCcoded 16dimensional modulation based on the NordstromRobinson nonlinear block code
 OSA Conf. Laser ElectroOptics (CLEO), JTh2A.24
, 2015
"... Recent forward error correction (FEC) codes based on lowdensity paritycheck (LDPC) codes have shown capacityachieving performance in practice. To support various modulation formats in conjunction with LDPC codes, bitinterleaved coded modulation (BICM) has been widely used. To achieve better perf ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
propose a new 16dimensional (16D) modulation based on the NordstromRobinson (NR) nonlinear code. The NR code is an optimal binary code, whose minimum Hamming distance is 6, whereas the bestknown linear code (BKLC) has a minimum distance of 5. We optimize LDPC codes for BICMID with various HDM formats
Results 1  10
of
17