Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

92

Voted

DCC
2006
IEEE

94views Computer Graphics» more DCC 2006»

A random construction for permutation codes and the covering radius

16 years 2 months ago

A random construction for permutation codes and the covering radius

Download www.its.caltech.edu

Peter Keevash, Cheng Yeaw Ku

Real-time Traffic

Computer Graphics | DCC 2006 | Permutation Codes |

claim paper

Related Content

» The Complexity of the Covering Radius Problem on Lattices and Codes

» On the PeaktoMean Envelope Power Ratio of PhaseShifted Binary Codes

» Explicit construction of a small epsilonnet for linear threshold functions

» On a New Class of Codes for Identifying Vertices in Graphs

» Uncoveringsbybases for basetransitive permutation groups

» Perfectly Secure Steganography Capacity Error Exponents and Code Constructions

» The existence of concatenated codes listdecodable up to the hamming bound

» Better Binary ListDecodable Codes Via Multilevel Concatenation

» Algorithms for SAT Based on Search in Hamming Balls

Post Info
More Details (n/a)

Added	25 Dec 2009
Updated	25 Dec 2009
Type	Conference
Year	2006
Where	DCC
Authors	Peter Keevash, Cheng Yeaw Ku

Comments (0)