#### Filter Results:

#### Publication Year

1997

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

All binary polynomials of degree up to 10 which are suitable to be used as generator polynomials of CRC codes are classified and all the necessary data for the evaluation of the error control performance of the CRC codes generated by the classified polynomials is calculated. A procedure, based on the computed data, for choosing the best CRC code is… (More)

Optimal (v, 4, 2, 1) optical orthogonal codes (OOC) with v <= 75 and v = 71 are classified up to equivalence. One (v, 4, 2, 1) OOC is presented for all v ≤ 181, for which an optimal OOC exists.

In this work a heuristic algorithm for obtaining lower bounds on the covering radius of a linear code is developed. Using this algorithm the least covering radii of the binary linear codes of dimension 6 are determined. Upper bounds for the least covering radii of binary linear codes of dimensions 8 and 9 are derived.