[Next][Prev] [Right] [Left] [Up] [Index] [Root]
Given a code C, return the number of codewords belonging to C.
Name(C, d) : Code, RngIntElt -> ModTupRngElt
Given a code C and a positive integer i,
return the i-th generator of C.
The underlying ring (or alphabet) R of the code C.
The ambient space of C, i.e., the generic R-space V in which
C is contained.
The basis of the linear code C, returned as a sequence of elements of C.
The pseudo-dimension k of the [n, k] linear code C.
This is the number of rows in the generator matrix, which gives a unique
canonical generating set for the code.
The generators for the linear code C, returned as a set.
The generator matrix for the linear code C. This gives a unique
canonical generating set for the code.
Given an [n, k] code C, return the generic [n, n, 1] code in which
C is contained.
Given an [n, k] code C, return the block length n of C.
Ngens(C) : Code -> RngIntElt
The number of generators (which equals the pseudo-dimension k) of the [n, k]
linear code C.
The parity check matrix for the code C, which can be defined as
the canonical generator matrix of the dual of C.
A random codeword of C.
Given an [n, k] linear code C, defined as a subspace
U of the n-dimensional space V, return U as a subspace
of V with basis corresponding to the rows of the
generator matrix for C.
The information rate of the [n, k] code C. This is the ratio k/n.
[Next][Prev] [Right] [Left] [Up] [Index] [Root]