Navigation
index
modules
|
next
|
Sage Reference Manual
»
Coding Theory
»
Coding Theory
¶
Abstract classes, catalogs and databases
¶
Decoder
Encoder
Index of bounds
Index of channels
Index of codes
Index of decoders
Index of encoders
Database of two-weight codes
Linear codes and related constructions
¶
Generic structures for linear codes
Generalized Reed-Solomon code
Hamming Code
Guruswami-Sudan decoder for Generalized Reed-Solomon codes
Interpolation algorithms for the Guruswami-Sudan decoder
Finding
-roots for polynomials over
, with`F` is a (finite) field, as used in the Guruswami-Sudan decoding.
Guruswami-Sudan utility methods
Subfield subcode
Linear code constructions
Punctured code
Extended code
Binary self-dual codes
Guava error-correcting code constructions
Fast binary code routines
Reed-Muller code
Bounds on codes
¶
Bounds for Parameters of Codes
Delsarte, a.k.a. Linear Programming (LP), upper bounds
Channels and related constructions
¶
Channels
Source coding
¶
Huffman Encoding
Canonical forms
¶
Canonical forms and automorphism group computation for linear codes over finite fields
Canonical forms and automorphisms for linear codes over finite fields
Other tools
¶
Management of relative finite field extensions
Indices and Tables
¶
Index
Module Index
Search Page
Table Of Contents
Coding Theory
Abstract classes, catalogs and databases
Linear codes and related constructions
Bounds on codes
Channels and related constructions
Source coding
Canonical forms
Other tools
Indices and Tables
Next topic
Decoder
This Page
Show Source
Quick search
Enter search terms or a module, class or function name.
Navigation
index
modules
|
next
|
Sage Reference Manual
»
Coding Theory
»