Sciweavers

1599 search results - page 20 / 320
» Algorithms for Parity Games
Sort
View
TIT
2002
146views more  TIT 2002»
14 years 9 months ago
Bounds on the performance of belief propagation decoding
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
David Burshtein, Gadi Miller
DDECS
2007
IEEE
121views Hardware» more  DDECS 2007»
15 years 4 months ago
A Novel Parity Bit Scheme for SBox in AES Circuits
– This paper addresses an efficient concurrent fault detection scheme for the SBox hardware implementation of the AES algorithm. Concurrent fault detection is important not only ...
Giorgio Di Natale, Marie-Lise Flottes, Bruno Rouze...
87
Voted
LICS
2008
IEEE
15 years 4 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
15 years 3 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