For 5G New Radio services with the requirement of high reliability and low latency, the HARQ loop can only afford one or a couple of retransmissions within the latency bound, or none at all, depending on the system configuration. In response to such stringent demand on the link adaptation algorithm, improved algorithms for predicting or estimating downlink channel conditions are desired. This paper describes the problem and proposes a solution where channel state statistics are reported by user equipment to aid the base station for more accurate downlink scheduling. Simulation results are provided to demonstrate the benefit of the new approach.

A sequence of q-ary cyclic codes is considered. For each finite field GF(q), q/spl ges/4, there is a code with parameters [n, k, d; q]=[q(q-1)+1, q(q-1)-6, 6; q]. We show that all these codes are n-, k-, and d-optimal, with only one exception. Also the dual codes are considered. Their true minimum distances are calculated in the range 4/spl les/q/spl les/32.

Let C be an [n,k,d]/sub q/ linear code. The defect of C is the parameter s=s(C)=n-k+1-d. If k/spl ges/m+1/spl ges/2 then by the Griesmer bound d/spl les/(q/sup m/(q-1)/q/sub m/-1)(s+m). The author's interest is in those linear codes having the maximum minimum distance, i.e., d=(q/sup m/(q-1)/q/sup m/-1)(s+m). For m=1 we have d=q(s+1) and the codes are maximum minimum distance (MMD) codes in the sense of Faldum and Willems (see ibid., vol.44, p.1555-58, 1998). Thus we consider MMD codes in a more general sense. We refer to them simply as MMD codes. All MMD codes with m=1 are known up to formal equivalence. Note that two codes are formally equivalent if they have the same weight distribution. The author classifies up to formal equivalence the MMD codes with m/spl ges/2.