Linear Codes: Systematic vs Non-Systematic

This lecture delves into the concept of linear codes, focusing on the distinction between systematic and non-systematic codes. The instructor explains the process of creating a generator matrix for a code, demonstrating how to transform a non-systematic code into a systematic one by swapping columns. Through examples and calculations, the lecture showcases the importance of systematic codes and how they simplify the encoding and decoding processes. The discussion also touches on the existence of systematic codes for every generator matrix, highlighting the flexibility and equivalence between systematic and non-systematic codes in the realm of linear algebra.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (472)

Related concepts (167)

COM-102: Advanced information, computation, communication II

Text, sound, and images are examples of information sources stored in our computers and/or communicated over the Internet. How do we measure, compress, and protect the informatin they contain?

Convolutional code

In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean polynomial function to a data stream. The sliding application represents the 'convolution' of the encoder over the data, which gives rise to the term 'convolutional coding'. The sliding nature of the convolutional codes facilitates trellis decoding using a time-invariant trellis. Time invariant trellis decoding allows convolutional codes to be maximum-likelihood soft-decision decoded with reasonable complexity.

Linear code

In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally partitioned into block codes and convolutional codes, although turbo codes can be seen as a hybrid of these two types. Linear codes allow for more efficient encoding and decoding algorithms than other codes (cf. syndrome decoding). Linear codes are used in forward error correction and are applied in methods for transmitting symbols (e.g.

Fountain code

In coding theory, fountain codes (also known as rateless erasure codes) are a class of erasure codes with the property that a potentially limitless sequence of encoding symbols can be generated from a given set of source symbols such that the original source symbols can ideally be recovered from any subset of the encoding symbols of size equal to or only slightly larger than the number of source symbols. The term fountain or rateless refers to the fact that these codes do not exhibit a fixed code rate.

Turbo code

In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed around 1990–91, but first published in 1993. They were the first practical codes to closely approach the maximum channel capacity or Shannon limit, a theoretical maximum for the code rate at which reliable communication is still possible given a specific noise level. Turbo codes are used in 3G/4G mobile communications (e.g.

Hamming code

In computer science and telecommunication, Hamming codes are a family of linear error-correcting codes. Hamming codes can detect one-bit and two-bit errors, or correct one-bit errors without detection of uncorrected errors. By contrast, the simple parity code cannot correct errors, and can detect only an odd number of bits in error. Hamming codes are perfect codes, that is, they achieve the highest possible rate for codes with their block length and minimum distance of three. Richard W.

Linear Algebra: Bases and Spaces MATH-111(e): Linear Algebra

Covers linear independence, bases, and spaces in linear algebra, emphasizing kernel and image spaces.

Characteristic Polynomials and Similar Matrices MATH-111(e): Linear Algebra

Explores characteristic polynomials, similarity of matrices, and eigenvalues in linear transformations.

Vector Spaces: Axioms and Examples MATH-111(e): Linear Algebra

Covers the axioms and examples of vector spaces, including matrices and polynomials.

Matrix Similarity and Diagonalization

Explores matrix similarity, diagonalization, characteristic polynomials, eigenvalues, and eigenvectors in linear algebra.

Vector Spaces: Subspaces and Bases

Covers subspaces, bases, linear independence, and dimensionality in vector spaces.