Metraipolis › archive › dc_f4531efc097b
Code rate — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Code_rate
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:11:29.371Z
- SHA-256 of the archived text
fe06a0fb84284c92667cbede88e39a39e9fb9904371720ab4705dde03c9c5532- Stable URL of this page
https://metraipolis.com/documento/dc_f4531efc097b
How to cite
Code rate — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Code_rate (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_f4531efc097b (Metraipolis archive dc_f4531efc097b, sha256 fe06a0fb84284c92667cbede88e39a39e9fb9904371720ab4705dde03c9c5532)
BibTeX
@misc{dcf4531efc097b,
title = {Code rate — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Code_rate},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_f4531efc097b; sha256 fe06a0fb84284c92667cbede88e39a39e9fb9904371720ab4705dde03c9c5532},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Code_rate. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In telecommunication and information theory, the code rate (or information rate) of a forward error correction code is the proportion of the data-stream that is useful (non-redundant). That is, if the code rate is k / n {\displaystyle k/n} , for every k bits of useful information, the coder generates a total of n bits of data, of which n − k {\displaystyle n-k} are redundant. If R is the gross bit rate or data signalling rate (inclusive of redundant error coding), the net bit rate (the useful bit rate exclusive of error correction codes) is ≤ R ⋅ k / n {\displaystyle \leq R\cdot k/n} . For example: The code rate of a convolutional code will typically be 1⁄2, 2⁄3, 3⁄4, 5⁄6, 7⁄8, etc., corresponding to one redundant bit inserted after every single, second, third, etc., bit. The code rate of the octet oriented Reed Solomon block code denoted RS(204,188) is 188/204, meaning that 204 − 188 = 16 redundant octets (or bytes) are added to each block of 188 octets of useful information. A few error correction codes do not have a fixed code rate—rateless erasure codes. Note that bit/s is a more widespread unit of measurement for the information rate, implying that it is synonymous with net bit rate or useful bit rate exclusive of error-correction codes.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «information theory»).
Fonte: Wikipedia in inglese, voce «Code rate» — https://en.wikipedia.org/wiki/Code_rate
Wikidata Q834373 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q834373
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Code_rate?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1340721591, consultata il 2026-10-07T21:49:51.801Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 059f542941713692e3fdf94ad60540a7d4f0aa9d0d9152380895e2b7c878fc31