Titlebook: Coding and Cryptology; Third International Yeow Meng Chee,Zhenbo Guo,Chaoping Xing Conference proceedings 2011 Springer Berlin Heidelberg

crease

The Minimum Distance of Graph Codes, to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other geometries. We give results on the minimum distances of the codes.

唠叨

Acetaldehyde

TOXIN

Locally Decodable Codes: A Brief Survey,lowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. Local decodability comes at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes require longer codeword lengths than their classical

inquisitive

独白

MOT

absorbed

Seeing Comics through Art HistoryQuantum error-correcting codes (QECC) are an important component of any future quantum computing device. After a brief introduction to stabilizer quantum codes, we present two methods to efficiently compute encoding circuits for them.

多产子

tackle

A Short History of Earth Observation,For a positive integer ., a family of quadriphase sequences with period . is proposed. The correlation values of the family and their distribution are completely determined. The maximum nontrivial correlation magnitude is . for odd ..