A codeword is a member of the specified set of words used to encode messages. For a linear code specified by a parity-check matrix H, the codewords are precisely the vectors satisfying Hc=0. The minimum distance between distinct codewords controls error correction.
The codeword length is the number of alphabet symbols in a codeword. For a binary word it counts bits; in a prefix code, it is the depth of the corresponding leaf in the code tree.
// Target: algebra.bigb
Ancestors (5)
Incoming links (83)
- Binary self-dual code contains the all-ones word
- Binary translation of a quaternary prefix code
- Block code for line coding
- Bounded-distance decoding
- Channel code
- Channel coding
- Channel decoder
- Channel encoder
- Code encoding
- Code rate
- Codeword
- Codeword length
- Coding theory
- Cross-entropy
- Deflate
- Deflate block framing
- Deflate Huffman coding
- Designed distance
- Discrete memoryless channel
- Entropy rate and coding length
- Error-correcting code
- Extended Hamming code
- Full-support probability distribution on a finite alphabet
- Huffman code
- Huffman coding
- Huffman sibling contraction
- Huffman sibling property
- Independent revelation of a binary variable
- Leaf depth in a code tree
- Low-weight coefficients of a binary Hamming code
- Negacyclic code
- Nonunique optimal prefix code
- Odd-length binary self-orthogonal dual extension
- Optimal prefix code
- Parity-check dependencies determine minimum distance
- Past exam of the communication Theory course of the University of Oxford / 2008 / 4 / a / ii / Solution
- Past exam of the communication Theory course of the University of Oxford / 2008 / 4 / b / Solution
- Past exam of the communication Theory course of the University of Oxford / 2009 / 2 / a / ii / Solution
- Past exam of the communication Theory course of the University of Oxford / 2010 / 1 / a / Solution
- Past exam of the communication Theory course of the University of Oxford / 2011 / 2 / a / ii / Solution
- Past exam of the communication Theory course of the University of Oxford / 2011 / 2 / a / i / Solution
- Past exam of the communication Theory course of the University of Oxford / 2011 / 2 / b / ii / Solution
- Past exam of the communication Theory course of the University of Oxford / 2011 / 2 / b / i / Solution
- Past exam of the communication Theory course of the University of Oxford / 2011 / 2 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computer networks / 1 / c / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / a / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / iii / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / ii / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / i / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / iv / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / c / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / d / Solution
- Past exam of the information theory course of the University of Oxford / 2023 / 2 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 30 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 30 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 30 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 36 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 36 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 33 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 33 / 4 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 33 / 4 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 87 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2005 / ii / Paper 2 / 4J / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / ii / Paper 2 / 4G / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / e / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / f / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / ii / Paper 3 / 4G / Solution
- Past exam of the mathematics course of the University of Cambridge / 2009 / ii / Paper 3 / 4H / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / ii / Paper 2 / 4H / Solution
- Quaternary Huffman coding
- Repetition code
- Shannon-Fano-Elias code
- Sibling leaves in a code tree
- Single-error test from two binary BCH syndromes
- Syndrome decoding
- Systematic encoding
- Ternary prefix code
- Total weight of a full-support binary linear code
- Trit
- Zero of a cyclic code
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.