Abstract
Streaming codes offer reliable recovery under decoding-delay constraint $\tau $ , of packets transmitted over a burst-and-random-erasure channel. Prior rate-optimal code constructions had field size quadratic in $\tau $ and employed diagonal embedding of a scalar block code of length $n$ within the packet stream. It is shown here that staggered diagonal embedding (SDE) under which the $n$ code symbols are dispersed across a span of $N \ge n$ successive packets leads to a simpler, low-complexity construction of rate-optimal streaming codes having linear field size. The limits of the SDE approach under the restriction $N \leq \tau +1$ are explored. Some binary streaming codes that are rate-optimal under this restriction are identified.
Published Version
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
