Noisy Transmission
Getting bits across a link that corrupts them: bit-flip and erasure models, capacity as the reliable-rate ceiling, then detection with checksums and repair with block codes. Core reliability ground.
part ofComputer science fundamentalsoverview, primer and where to startread it →on this pageshowhide
explore
- Symmetric & Erasure Channels5 questions
- Channel Capacity5 questions
- Parity & Checksums5 questions
- Cyclic Redundancy Checks5 questions
- Hamming Distance & Codes5 questions
- Reed-Solomon & Erasure Coding6 questions
- AI & Data Scientistrole
- Backend Developerrole
- Blockchain Developerrole
- Computer Scienceskill
- Data Analystrole
- Data Engineerrole
- Forward Deployed Engineerrole
- Full Stack Developerrole
- Game Developerrole
- Java Backend Developerrole
- Kotlin Backend Developerrole
- Machine Learning Engineerrole
- Server-Side Game Developerrole
- Software Architectrole
questions
page 2 of 2When should a receiver declare a doubtful symbol erased instead of guessing its value, and what does that choice cost?
level: principalimportance: nice to knowfreq 26%
basics
~20 sDeclare erasures when wrong data downstream costs more than missing data, since a marked gap is cheaper to repair than a silent flip. The cost is false erasures: symbols that were probably fine, thrown away and charged to the repair budget.
showing 31–31 of 31