2957 search results - page 109 / 592 » Code analysis and CS-XML |
102
click to vote
IMA
1995
Springer
15 years 6 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
124
click to vote
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—In this paper, we present a novel method to construct nonbinary irregular LDPC codes whose parity check matrix has only column weights of 2 and t, where t ≥ 3. The constructed...
112
click to vote
SERP
2003
15 years 4 months ago
2003
Abstract New algorithms are constantly developed in search of better or faster results. Many variants of code are often tried while searching for the best solution. When the number...
110
click to vote
TIT
2008
15 years 2 months ago
2008
In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are stu...
116
click to vote
JSA
2007
15 years 2 months ago
2007
— Hardware implementations of cryptographic algorithms are vulnerable to fault analysis attacks. Methods based on traditional fault-tolerant architectures are not suited for prot...