Sciweavers

AAECC
2007
Springer
143views Algorithms» more  AAECC 2007»
14 years 6 months ago
Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields
Abstract. We describe some constructions of orthonormal lattices in totally real subfields of cyclotomic fields, obtained by endowing their ring of integers with a trace form. We...
B. A. Sethuraman, Frédérique E. Oggi...
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
14 years 6 months ago
Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF ( p , 2)
The uniform distribution of the trace map lends itself very well to the construction of binary and non-binary codes from Galois fields and Galois rings. In this paper we study the...
N. Pinnawala, A. Rao, T. Aaron Gulliver
AAECC
2007
Springer
105views Algorithms» more  AAECC 2007»
14 years 6 months ago
On Non-randomness of the Permutation After RC4 Key Scheduling
Abstract. Here we study a weakness of the RC4 Key Scheduling Algorithm (KSA) that has already been noted by Mantin and Mironov. Consider the RC4 permutation S of N (usually 256) by...
Goutam Paul, Subhamoy Maitra, Rohit Srivastava
AAECC
2007
Springer
133views Algorithms» more  AAECC 2007»
14 years 6 months ago
Linear Complexity and Autocorrelation of Prime Cube Sequences
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song
AAECC
2007
Springer
194views Algorithms» more  AAECC 2007»
14 years 6 months ago
Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions - 9 Variable Boolean Functions with Nonlinearity 242
Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Sy...
Selçuk Kavut, Melek D. Yücel
AAECC
2007
Springer
118views Algorithms» more  AAECC 2007»
14 years 6 months ago
The "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
Navin Kashyap
AAECC
2007
Springer
113views Algorithms» more  AAECC 2007»
14 years 6 months ago
Generalized Sudan's List Decoding for Order Domain Codes
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
Olav Geil, Ryutaroh Matsumoto
AAECC
2007
Springer
89views Algorithms» more  AAECC 2007»
14 years 6 months ago
Links Between Discriminating and Identifying Codes in the Binary Hamming Space
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On ) the set of vectors with even (respectively, odd)...
Irène Charon, Gérard D. Cohen, Olivi...
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
14 years 6 months ago
Extended Norm-Trace Codes with Optimized Correction Capability
We consider a generalization of the codes defined by norm and trace functions on finite fields introduced by Olav Geil. The codes in the new family still satisfy Geil’s dualit...
Maria Bras-Amorós, Michael E. O'Sullivan