<--- Back to Details
First PageDocument Content
Theoretical computer science / Decoding methods / Block code / Hamming bound / Binary symmetric channel / Reed–Solomon error correction / Hamming code / Hamming distance / Hamming / Coding theory / Mathematics / Notation
Date: 2012-08-31 11:04:32
Theoretical computer science
Decoding methods
Block code
Hamming bound
Binary symmetric channel
Reed–Solomon error correction
Hamming code
Hamming distance
Hamming
Coding theory
Mathematics
Notation

Chapter 2 Sphere Packing and

Add to Reading List

Source URL: www.mth.msu.edu

Download Document from Source Website

File Size: 255,97 KB

Share Document on Facebook

Similar Documents

Coding theory / Error detection and correction / Hamming code / Linear code / ReedSolomon error correction / Forward error correction / Hamming / GilbertVarshamov bound / Block code / Justesen code

Spectral Graph Theory Lecture 11 Introduction to Coding Theory Daniel A. Spielman

DocID: 1p98C - View Document

Coding theory / Error detection and correction / Information theory / Discrete mathematics / Mathematics / Linear code / Hamming code / ReedSolomon error correction / Forward error correction / Hamming / Generator matrix / Singleton bound

Signal and Information Processing Laboratory Institut für Signal- und Informationsverarbeitung August 2015

DocID: 1kCfk - View Document

BRICS Basic Research in Computer Science BRICS RSJ. Pagter: Ajtai, Branching Programs and the Hamming Distance Problem On Ajtai’s Lower Bound Technique for

DocID: 1b5zt - View Document

Applied mathematics / Hamming distance / Hamming / Oracle machine / Plotkin bound / IP / Quantum algorithm / Walsh–Hadamard code / GV-linear-code / Coding theory / Mathematics / Theoretical computer science

11 JuneSINGLE-QUERY LEARNING FROM ABELIAN AND NON-ABELIAN HAMMING DISTANCE ORACLES David A. Meyer∗ and James Pommersheim∗,†

DocID: 13Gld - View Document

Data management / Computer programming / Distributed data storage / Tango tree / B-tree / Binary trees / Computing

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube Amit Chakrabarti Bernard Chazelle Benjamin Gum

DocID: 102Rc - View Document