The following sections start with the description of creating codes from user defined matrices or special matrices (see ElementsCode, HadamardCode, ConferenceCode and MOLSCode). These codes are unrestricted codes; they may later be discovered to be linear or cyclic.
The next section describes a function for generating random codes (see RandomCode).
The next section describes the Nordstrom-Robinson code (see NordstromRobinsonCode).
The last sections describe two functions for generating Greedy codes. These are codes that contructed by gathering codewords from a space (see GreedyCode and LexiCode).
GAP 3.4.4