Sciweavers

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

77

AAECC
1991
Springer

90views Algorithms» more AAECC 1991»

Polynomial-Time Construction of Spherical Codes

15 years 6 months ago

Polynomial-Time Construction of Spherical Codes

Download iml.univ-mrs.fr

Gilles Lachaud, Jacques Stern

Real-time Traffic

AAECC 1991 | Algorithms |

claim paper

Related Content

» Hardness amplification within NP

» A Polynomial Algorithm for Codes Based on Directed Graphs

» Diversity Embedded Streaming Erasure Codes DESCo Constructions and Optimality

» Explicit Codes Achieving List Decoding Capacity ErrorCorrection With Optimal Redundancy

» TCHo A HardwareOriented Trapdoor Cipher

» Better Binary ListDecodable Codes Via Multilevel Concatenation

» Public Key Locally Decodable Codes with Short Keys

» Complexity of Decoding PositiveRate ReedSolomon Codes

» The Art of Signaling Fifty Years of Coding Theory

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	AAECC
Authors	Gilles Lachaud, Jacques Stern

Comments (0)