Sciweavers

118 search results - page 6 / 24
» Permutation codes
Sort
View
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
14 years 2 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
TCOM
2010
98views more  TCOM 2010»
13 years 5 months ago
Large-Girth Nonbinary QC-LDPC Codes of Various Lengths
In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either ...
Jie Huang, Lei Liu, Wuyang Zhou, Shengli Zhou
TIT
2010
170views Education» more  TIT 2010»
13 years 5 months ago
Correcting charge-constrained errors in the rank-modulation scheme
We investigate error-correcting codes for a the rank-modulation scheme with an application to flash memory devices. In this scheme, a set of n cells stores information in the permu...
Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck
ARCS
2004
Springer
14 years 4 months ago
Implementation and Evaluation of a Parallel-External Algorithm for Cycle Structure Computation on a PC-Cluster
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...
Latifa Boursas, Jörg Keller
CADE
2003
Springer
14 years 11 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...