<--- 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 / Information theory / Discrete mathematics / Mathematics / Low-density parity-check code / Forward error correction / Binary symmetric channel / Noisy-channel coding theorem / Linear code / Prefix code / Huffman coding

Sparse Data Blocks and Multi-User Channels Edward A. Ratzer Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE, UK Phone: +Email: October 25, 2002

DocID: 1qcFJ - View Document

Error detection and correction / Coding theory / Information theory / Discrete mathematics / Mathematics / Convolutional code / Systematic code / Turbo code / Sequential decoding / Binary symmetric channel / Linear code / Viterbi algorithm

Convolutional code performance as a function of decoding delay Edward A. Ratzer Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE Phone: Email:

DocID: 1pTE4 - View Document

Error detection and correction / Coding theory / Low-density parity-check code / Forward error correction / Convolutional code / Turbo code / EXIT chart / Noisy-channel coding theorem / Linear code / Code / Block code / Binary symmetric channel

Error-correction on non-standard communication channels Edward A. Ratzer Christ’s College Cambridge

DocID: 1ptFs - View Document

Information theory / Information / Theoretical computer science / Telecommunications engineering / Information-theoretic security / Channel capacity / Channel / Code / Noisy-channel coding theorem / Binary symmetric channel

2748 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 5, MAY 2012 Three-Receiver Broadcast Channels With Common and Confidential Messages

DocID: 1meJI - View Document

1998 Paper 8 Question 11 Information Theory and Coding Consider a binary symmetric communication channel, having source alphabet X = {0, 1} with probabilities {0.5, 0.5}. Its output alphabet is Y = {0, 1} and its channe

DocID: 1deth - View Document