OpenGrey (Institut de l'Information Scientifique et Technique) · 1995 · 42 citations · 0 references
Open access
EngineeringComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureCryptographyChannel CodingCoding TheoryComputational ComplexityError Control CodingError-correcting CodesBch CodesBinary CodesDecoding AlgorithmsHamming DistanceLinear Block CodesLinear CodesMinimum DistanceRandom Linear Codes
An algorithm for finding small-weight words in large linear codes is developed. It is in particular able to decode random [512,256,57]-linear codes in 9~hours on a DEC alpha computer. We determine with it the minimum distance of some binary BCH codes of length~511, which were not known.