Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Luby (2002)
LT codesThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
(1989)
He is now a Professor with the Department of Information Management
A. Shokrollahi (2007)
Raptor Codes2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks
C. Berrou, A. Glavieux, P. Thitimajshima (1993)
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Proceedings of ICC '93 - IEEE International Conference on Communications, 2
Hong Chen, R. Maunder, L. Hanzo (2013)
A Survey and Tutorial on Low-Complexity Turbo Coding Techniques and a Holistic Hybrid ARQ Design ExampleIEEE Communications Surveys & Tutorials, 15
Christian Schlegel, Lance Perez (2004)
Low-Density Parity-Check Codes
M. Luby, M. Mitzenmacher (2005)
Verification-based decoding for packet-based low-density parity-check codesIEEE Transactions on Information Theory, 51
J. Byers, M. Luby, M. Mitzenmacher, A. Rege (1998)
A digital fountain approach to reliable distribution of bulk data
DR Hughes, F Piper (1973)
Projective planes
M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman (2001)
Efficient erasure correcting codesIEEE Trans. Inf. Theory, 47
K. Yar, Do-Sik Yoo, W. Stark (2008)
Performance of RS coded M-ary modulation with and without symbol overlappingIEEE Transactions on Communications, 56
Emilia Käsper (2005)
Turbo Codes
Do-Sik Yoo, W. Stark, K. Yar, Seong-Jun Oh (2010)
Coding and Modulation for Short Packet TransmissionIEEE Transactions on Vehicular Technology, 59
Yuval Cassuto, A. Shokrollahi (2015)
Online Fountain Codes With Low OverheadIEEE Transactions on Information Theory, 61
Segment Combining and Patching for Short Packet Forward… 6439
A Shokrollahi (2006)
Raptor codesIEEE Transactions on Information Theory, 52
Firm Moore, W. Brady, Frederick Telecky (2017)
Polynomial Codes Over Certain Finite Fields
R. Hamming (1950)
Error detecting and error correcting codesBell System Technical Journal, 29
Modern networks are popular with a large number of short packets generated by many light weight, low power devices. We propose a new approach, segment combining and patching (SCP), for forward error control coding suitable for short packets, where the encoder logically divides a full packet into a number of partially overlapped subpackets based on a Finite Projective Plane of order m, and transmits the full packet n times. Upon receiving all n replicas of a full packet, the decoder generates an additional combined packet using Maximum Ratio Combining. By selecting non-faulty subpackets through Cyclic Redundancy Checks, both inter-cluster and intra-cluster patching are then performed on the n + 1 clusters of subpackets until no new non-faulty subpackets are generated. Simulation results in both AWGN and block fading channels demonstrate that the SCP is an effective approach for forward error control coding for short packet communication in embedded networks, sensor networks, and so on. Lastly, we provide a theory of SCP to show how it works.
Wireless Personal Communications – Springer Journals
Published: Aug 11, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.