Sciweavers

386 search results - page 21 / 78
» The Weights in MDS Codes
Sort
View
TIT
2008
68views more  TIT 2008»
14 years 11 months ago
Signaling Over Arbitrarily Permuted Parallel Channels
The problem of transmission of information over arbitrarily permuted parallel channels is studied here. The transmitter does not know over which channel a certain codesequence will...
Frans M. J. Willems, Alexei Gorokhov
DM
2008
97views more  DM 2008»
14 years 12 months ago
On the integral ring spanned by genus two weight enumerators
Abstract. It is known that the weight enumerator of a self-dual doublyeven code in genus g = 1 can be uniquely written as an isobaric polynomial in certain homogeneous polynomials ...
Manabu Oura
EUROCRYPT
1999
Springer
15 years 4 months ago
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
Thomas Johansson, Fredrik Jönsson
PR
2007
88views more  PR 2007»
14 years 11 months ago
Robust kernel Isomap
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
Heeyoul Choi, Seungjin Choi
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 11 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov