Abstract: A technique deals with wide classes of cyclic codes for simple burst trapping decoding of almost all bursts of length which approaches twice the maximum guaranteed burst length correcting capability with good burst error correcting and detecting capability. The vector symbol codes achieve the highest burst correcting capability but use very long codes. "Perfect" codes can correct all bursts up to length t, and almost all bursts of length l, where t+1.ltoreq.l.ltoreq.n-k-t, with less than n2.sup.-(t-1) incorrect decoding probability for an n-bit code. The probability of an undetected error for any length burst is less than n2.sup.-(t-1). Shortened "perfect" codes can detect any burst of a double or triple error pattern.