Sciweavers

215 search results - page 4 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
TIT
2008
73views more  TIT 2008»
14 years 9 months ago
Turbo Codes in Binary Erasure Channel
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...
Jeong Woo Lee, Rüdiger L. Urbanke, Richard E....
TIT
2010
111views Education» more  TIT 2010»
14 years 4 months ago
On correctable errors of binary linear codes
The error correction capability of binary linear codes with minimum distance decoding, in particular the number of correctable/uncorrectable errors, is investigated for general lin...
Kenji Yasunaga, Toru Fujiwara
CORR
2006
Springer
96views Education» more  CORR 2006»
14 years 9 months ago
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...
ACMSE
2010
ACM
14 years 7 months ago
Generating three binary addition algorithms using reinforcement programming
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to gene...
Spencer K. White, Tony R. Martinez, George L. Rudo...
73
Voted
TIT
2002
98views more  TIT 2002»
14 years 9 months ago
DC-free binary convolutional coding
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
Tadashi Wadayama, A. J. Han Vinck