Results 251 to 260 of about 49,874 (298)

Neural manifolds that orchestrate walking and stopping

Komi S, Kaur J, Winther A, Bonfils MCA, Houser GA, Sørensen R, Li G, Sobriel K, Berg RW.   +8 more
europepmc   +1 more source

Generalized Stopping Sets and Stopping Redundancy [PDF]

2007 Information Theory and Applications Workshop, 2007
Iterative decoding for linear block codes over erasure channels may be much simpler than optimal decoding but its performance is usually not as good. Here, we present a general iterative decoding technique that gives a more refined trade-off between complexity and performance. In each iteration, a system of equations is solved.
Khaled A.S. Abdel-Ghaffar, Jos H. Weber
openaire   +2 more sources

Pseudocodeword weights and stopping sets [PDF]

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
We examine the structure of pseudocodewords in Tanner graphs and derive lower bounds of pseudocodeword weights. The weight of a pseudocodeword is related to the size of its support set, which forms a stopping set in the Tanner graph.
Kelley, C, Sridhara, D, Xu, J, Rosenthal, J   +3 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Stopping Sets of Hermitian Codes

IEEE Transactions on Information Theory, 2016
Combinatorial structures called stopping sets are useful in analyzing the performance of a linear code when coupled with an iterative decoding algorithm over an erasure channel. In this paper, we consider stopping sets of Hermitian codes.
Gretchen L Matthews
exaly   +2 more sources

Stopping set elimination for LDPC codes [PDF]

2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017
This work studies the Stopping-Set Elimination Problem, namely, given a stopping set, how to remove the fewest erasures so that the remaining erasures can be decoded by belief propagation in k iterations (including k =∞). The NP-hardness of the problem is proven. An approximation algorithm is presented for k = 1.
Anxiao Andrew Jiang, Pulakesh Upadhyaya, Ying Wang, Krishna R. Narayanan, Hongchao Zhou, Jin Sima, Jehoshua Bruck   +6 more
openaire   +3 more sources

Small stopping sets in Steiner triple systems

Cryptography and Communications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles J Colbourn, Colbourn Charles J
exaly   +2 more sources

Stopping sets for physical-layer security

2010 IEEE Information Theory Workshop, 2010
Physical-layer security based on wiretap codes can be used to complement cryptographic applications at higher layers of the protocol stack. We assume a passive eavesdropper that has access to noise-corrupted codewords with erasures that are statistically independent to those of the legitimate communication partners.
Willie K. Harrison, João Almeida 0004, Demijan Klinc, Steven W. McLaughlin, João Barros   +4 more
openaire   +1 more source

Stopping set analysis for Hamming codes

IEEE Information Theory Workshop, 2005., 2005
In the 2004 Shannon Lecture, McEliece presented an expression for the number of stopping sets of size three in a Hamming code. In this paper, we investigate how this number depends on the parity-check matrix used in the decoding process. First, we present basic results on stopping set enumerators for block codes in general.
Jos H. Weber, Khaled A. S. Abdel-Ghaffar
openaire   +1 more source

Stopping Set Distribution of LDPC Code Ensembles

IEEE Transactions on Information Theory, 2003
Stopping sets determine the performance of low-density parity-check (LDPC) codes under iterative decoding over erasure channels. We derive several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles, including the following. An expression for the normalized average stopping set distribution, yielding, in particular, a critical
Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang   +2 more
openaire   +1 more source