Linear code
    flowchart
    AA["Associated Authors (0)"]
    C[Linear code]
    BC["Broader Concepts (1)"]
    NC["Narrower Concepts (27)"]
    C== skos:broader ==>BC
    NC== skos:broader ==>C
    AA== dcterms:relation ==>C
    click BC "#broader-concepts"
    click NC "#narrower-concepts"
    click AA "#associated-authors"
    NI["add incoming edge"]
    NO["add outgoing edge"]
    NI-- ? -->C
    C-- ? -->NO
    click NI "#add-incoming-edge"
    click NO "#add-outgoing-edge"
    style NI stroke-width:2px,stroke-dasharray: 5 5
    style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q1752667
- OpenAlex ID
- https://openalex.org/C2400350 (API record)
- OpenAlex Description
- class of error correction code
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- BCJR algorithm
- Berlekamp–Welch algorithm
- Constant-weight code
- Cyclic code
- Dual code
- Expander code
- Fountain code
- Group code
- Hamming bound
- Hamming graph
- Hamming weight
- Hamming(7,4)
- Luby transform code
- Online codes
- Polynomial code
- Prefix code
- Quantum convolutional code
- Raptor code
- Reed–Muller code
- Reed–Solomon error correction
- Repetition code
- Serial concatenated convolutional codes
- Space–time trellis code
- Tanner graph
- Ternary Golay code
- Tornado code
- Universal code
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.
 HelioWeb
 HelioWeb