Abstract
The letter presents binary cyclic codes with the maximum burst error correction capability. This is achieved based on the properties of circulant parity check matrix. Results conclude existence of codes with high minimum weight and rate greater than 0.28. It also gives cyclic product codes suitable for multiple burst and random error corrections.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
