Author :
Groneick, Bernhard ; Grosse, Stephan
Author_Institution :
Inst. of Math., Munster Univ., Germany
fDate :
3/1/1994 12:00:00 AM
Abstract :
We report on the construction of many binary linear codes improving the tables of the best known codes. We obtained our results by applying the following known constructions: shortening and puncturing codes by analyzing their duals; and transferring a [64,8,43] code over GF(4) into a binary code and applying various constructions to the resulting code
Keywords :
binary sequences; codes; binary linear codes; code puncturing; code shortening; Binary codes; Distributed computing; Linear code; Linear programming; Mathematics;
Journal_Title :
Information Theory, IEEE Transactions on
