Sciweavers

118 search results - page 10 / 24
» Permutation codes
Sort
View
DCC
2006
IEEE
15 years 9 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey
ASIACRYPT
2001
Springer
15 years 2 months ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...
ISCAS
2005
IEEE
126views Hardware» more  ISCAS 2005»
15 years 3 months ago
Scheduling algorithm for partially parallel architecture of LDPC decoder by matrix permutation
— The fully parallel LDPC decoding architecture can achieve high decoding throughput, but it suffers from large hardware complexity caused by a large set of processing units and ...
In-Cheol Park, Se-Hyeon Kang
DAGSTUHL
2006
14 years 11 months ago
Vertex reconstruction in Cayley graphs
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
Elena V. Konstantinova
ICWS
2008
IEEE
14 years 11 months ago
High-Performance XML Parsing and Validation with Permutation Phrase Grammar Parsers
The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for interoperability. The interoperability of XML Web services often comes a...
Wei Zhang, Robert A. van Engelen