We prove that the smallest covering code of length 8 and covering radius 2 has exactly 12 words. The proof is based on partial classi cation of even weight codewords, followed by a search for small sets of odd codewords covering the part of the space that has not been covered by the even subcode.

the present study was conducted to determine peak ground acceleration (pga) over bedrock in probabilistic analysis methods for the seismic hazard and uniform hazard spectra at different hazard levels for esfahan city. a series of statistics containing historical and instrumental seismic data covering from the 8th century a.d. to the now up to a radius of 200 km was employed and seismic sources ...

The present study was conducted to determine peak ground acceleration (PGA) over bedrock in probabilistic analysis methods for the seismic hazard and uniform hazard spectra at different hazard levels for Esfahan city. A series of statistics containing historical and instrumental seismic data covering from the 8th century A.D. to the now up to a radius of 200 km was employed and seismic sources ...

Given a finite point set Z ⊂ R, the covering radius of a nonempty subset X ⊂ Z is the minimum distance rX,Z such that every point in Z is at a distance of at most rX,Z from some point in X. This paper concerns the construction of a sequence of subsets of decreasing sizes, such that their covering radii are small. To this end, a method for progressive data reduction, referred to as scattered dat...