论文信息 - On Bounded-Weight Error-Correcting Codes

On Bounded-Weight Error-Correcting Codes

This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting codes, and evaluate the differences.

Russell Bent | Lane A. Hemaspaandra | Gabriel Istrate | Michael Schear

[1] Emile H. L. Aarts,et al. Genetic Algorithms in Coding Theory - A Table for A3(n, d) , 1993, Discret. Appl. Math..

[2] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[3] N. J. A. Sloane,et al. A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[4] N. J. A. Sloane,et al. The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration , 1992, J. Comb. Theory, Ser. A.

[5] N. J. A. Sloane,et al. Bounds on Mixed Binary/Ternary Codes , 1998, IEEE Trans. Inf. Theory.

[6] P. Pardalos,et al. An exact algorithm for the maximum clique problem , 1990 .

[7] Lane A. Hemaspaandra,et al. Using simulated annealing to design good codes , 1987, IEEE Trans. Inf. Theory.