Computer Science – Information Theory
Scientific paper
2011-04-07
Computer Science
Information Theory
Submitted to IEEE Globecom 2011
Scientific paper
In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single burst correction (SBC), is shown to be the Abramson bound when the cyclic burst length is less than half the block length. The second MPBC bound is developed without the minimum error free gap constraint and is used as a comparison to the first bound.
No associations
LandOfFree
Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-718189