奇偶校验位问题
我已经阅读了有关“奇偶校验位”方法的信息，以及如何使用它来检查“数据包”是否正确接收。
所以使用奇校验：（来自wiki）
A wants to transmit: 1001
A computes parity bit value: ~(1^0^0^1) = 1
A adds parity bit and sends: 10011
B receives: 10011
B computes overall parity: 1^0^0^1^1 = 1
B reports correct transmission after observing expected odd result.
如果在传输过程中，而不是“10011”，会怎么样？ 收到“11001”。奇偶校验将如何检查这一点，因为它只检查“1”的数量？ 或者像我之前所说的那样，比特在传输过程中不可能改变？谢谢
i have been readin about the "parity bit" method, and how is is used to check is the "packet" is received correctly.
so using odd parity: (from wiki)
A wants to transmit: 1001
A computes parity bit value: ~(1^0^0^1) = 1
A adds parity bit and sends: 10011
B receives: 10011
B computes overall parity: 1^0^0^1^1 = 1
B reports correct transmission after observing expected odd result.
what if during the transmission, instead of "10011",
"11001" is received. how will the parity check for that, since it checks only the number of "1"'s ?
or is it impossible for bits to change during transmission like i stated before? thx
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
奇偶校验位是最简单的错误检测技术。如果奇数位（包括奇偶校验位）传输不正确，它会起作用。因此，如果两个位损坏，则它将无法工作。
Parity bit is simplest error detection technique. It works if odd number of bits (including the parity bit) are transmitted incorrectly. So if two bits are corrupt then it will not work.