Sentence examples for distance of the code from inspiring English sources

The rate and the minimum distance of the code ({mathcal C}) depends on the rate and the minimum distance of the code ({mathcal C}_{0}).

This is the reason that the performance improves as the minimum distance of the code increases.

Retrieving similar neighbors is then simply accomplished by retrieving images that have codes within a small Hamming distance of the code of the query.

Then, the minimum Hamming distance of the code is greater than the largest number of consecutive integers modulo n in E = {e1,⋯2,en−k,en−k}.

These skills can decode the code when the number of erasures and errors is within the minimum distance of the code.

where is the normalized minimum distance of the constellation χ1, dfree is the free distance (minimum Hamming distance) of the code.

The average K2P distance of these UTRs and their three-spined stickleback orthologous sequence was 0.0709 ± 0.0020 (median = 0.0688), whereas the average K2P distance of the coding regions for these same genes was 0.0513 ± 0.0017 (median = 0.0436).

where dfree is the free distance of the convolutional code, which is the PHY FEC code (PHY channel code), selected in PHY mode m, a d is the total number of error events of weight d, and P d is the probability that an incorrect path at distance d from the correct path is being chosen by the Viterbi decoder.

be the transfer function of the zero-tail convolutional code [15], where dfree is the free distance of the convolutional code, a ij is the number of paths with Hamming weight i that are generated by data sequences containing j non-zero bits, and the exponents of D and N describe the Hamming weights of coded sequences and data sequences of the paths, respectively.

The t-form space F is shown to have the structure of an ideal, and the canonical generator of F to be computable from the distance distribution of the code Γ.

The minimum distance of this code is equal to 12. Again, NCC still achieves diversity order 2 for both N r =2 and N r =4, and the performance of NCC in both cases is similar.