Sdq ( b ) codes over finite fields are byte - organized and they can correct any single error and detect all double - ajacent errors in the same byte . for sdq ( b ) codes satisfying q > 3 , b > 2 over finite field fq , we give a lower bound than the pairs bound 有限域上的sd _ q ( b )码是一类按字节组织的，能纠正发生的所有单个错误，同时能检测发生在同一字节内的两个相邻错误的纠错码；我们对有限域f _ q上sd _ q ( b )码的线对界在q 3 ， b 2时给出了一个改进界。
For the sake of allocating bandwidth fairer both in an environment mixed with unresponsive and responsive flows and in one full of tcp flows , friday ( fair random indication with discarding aggressiveness yardstick ) algorithm is presented and researched , combined with a fcfs and fq ( fair queueing ) scheduler , in chapter iv 为了在响应流和非响应流混合的环境中，以及在tcp流为主的环境中，都能用某种缓存管理技术更公平地分配带宽，本文在第四章提出friday (服从激进流丢弃准则的公平随机指示)算法，并将其与fcfs和fq (公平排队)调度算法结合研究。
