USACO2.1.5--Hamming Codes
摘要:
Hamming CodesRob KolstadGiven N, B, and D: Find a set of N codewords (1 <= N <= 64), each of length B bits (1 <= B <= 8), such that each of the codewords is at least Hamming distance of D (1 <= D <= 7) away from each of the other codewords. The Hamming distance between a pair of co 阅读全文
posted @ 2013-02-03 22:02 仗剑奔走天涯 阅读(192) 评论(0) 推荐(0) 编辑