Bose-Chaudhuri-Hocquenghem (BCH) error correction codes using Galois Field arithmetic. Can detect and correct multiple random errors in transmitted data. Educational implementation for learning error correction principles.
| Property | Value |
|---|---|
| Category | Error Correction |
| Sub-category | Cyclic Code |
| Security status | 🎓 Educational Only |
| Complexity | Advanced |
| Inventor | R.C. Bose, D.K. Ray-Chaudhuri, A. Hocquenghem |
| Year | 1960 |
| Origin | 🌐 International |
| Source | algorithms/ecc/bch.js |
Status: 🎓 Educational Only
| Issue | Description | Mitigation |
|---|---|---|
| Limited Error Correction Capacity | BCH codes can only correct up to t errors per codeword. Beyond this limit, errors may go undetected or be incorrectly corrected | — |
| Implementation Complexity | Requires careful Galois Field arithmetic implementation to avoid introducing errors in the correction process | — |
2 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — BCH Error-free data test
| Field | Value |
|---|---|
input |
00000000 |
expected |
0000000000 |
Vector 2 — BCH Pattern data test
| Field | Value |
|---|---|
input |
01010101 |
expected |
0101010100 |