Filters








11,518 Hits in 3.6 sec

A Note on Decoding of Superimposed Codes

Tayuan Huang, Chih-Wen Weng
2003 Journal of combinatorial optimization  
Our method is a generalization of the classical result of Kautz and Singleton (Nonadaptive binary superimposed codes, IEEE Trans.  ...  A superimposed code with general distance D can be used to construct a non-adaptive pooling design.  ...  Acknowledgment The authors thank an anonymous referee of the preprint (Huang and Weng, submitted) for enlightening the line of study and many valuable ideas.  ... 
doi:10.1023/b:joco.0000017386.09330.70 fatcat:362zxw76rvgklhlbpopt647vu4

Distributed space-time coding of over-the-air superimposed packets in wireless networks

Antonios Argyriou
2013 2013 IEEE International Conference on Communications (ICC)  
With the proposed scheme the participating relays create a ST code for the over-the-air superimposed symbols that are received locally and without proceeding to any decoding step beforehand.  ...  In this paper we propose a new cooperative packet transmission scheme that allows independent sources to superimpose over-the-air their packet transmissions.  ...  This is accomplished first by applying the space-time code not on the symbols of interest themselves, but on the nondecodable superimposed signal of several symbols, and second by shifting the decoding  ... 
doi:10.1109/icc.2013.6655355 dblp:conf/icc/Argyriou13 fatcat:ulc6sjadavfxtcwxg5unq2t4ae

Distributed Space-Time Coding of Over-the-Air Superimposed Packets in Wireless Networks [article]

Antonios Argyriou
2013 arXiv   pre-print
With the proposed scheme the participating relays create a ST code for the over-the-air superimposed symbols that are received locally and without proceeding to any decoding step beforehand.  ...  In this paper we propose a new cooperative packet transmission scheme that allows independent sources to superimpose over-the-air their packet transmissions.  ...  This is accomplished first by applying the space-time code not on the symbols of interest themselves, but on the nondecodable superimposed signal of several symbols, and second by shifting the decoding  ... 
arXiv:1303.3427v1 fatcat:3hxs77lq3jd3li7vy4kjkyzv4u

Pairwise Check Decoding for LDPC Coded Two-Way Relay Fading Channels

J. Liu, M. Tao, Y. Xu, X. Wang
2010 2010 IEEE International Conference on Communications  
The proposed PCD method forms a socalled check-relationship table for the superimposed Low-Density Parity-Check (LDPC)-coded packet pair during the multiple access phase.  ...  The proposed PCD method is a practical and efficient realization of the promising denoise-and-forward relay strategy with advanced channel coding and non-linear network coding.  ...  The main idea is to construct a check relationship table, which consists of two parts, one for virtual encoder and one for decoding, for the superimposed LDPC coded packet pair.  ... 
doi:10.1109/icc.2010.5501910 dblp:conf/icc/LiuTXW10 fatcat:waorzsijdvbi3c2pkwam4od2r4

Deep Learning Based Near-Orthogonal Superposition Code for Short Message Transmission [article]

Chenghong Bian, Mingyu Yang, Chin-Wei Hsu, Hun-Seok Kim
2021 arXiv   pre-print
In this paper, a novel deep learning based near-orthogonal superposition (NOS) coding scheme is proposed for reliable transmission of short messages in the additive white Gaussian noise (AWGN) channel  ...  The proposed NOS encoder and decoder are deep neural networks (DNNs) jointly trained as an auto encoder and decoder pair to learn a new NOS coding scheme with near-orthogonal codewords.  ...  A DNN based decoder is trained to estimate the probability of superimposed one-hot coded information vectors from the received vector.  ... 
arXiv:2111.03263v2 fatcat:niesv75kizhw5axka76bapaenq

Page 4701 of Mathematical Reviews Vol. , Issue 92h [page]

1992 Mathematical Reviews  
On the basis of the Viterbi decoding algorithm new formulas for the symbol error probability of binary convolutional codes over a BSC are derived.  ...  Summary: “A generalization of the Sullivan inequality on the ratio of the probability of a linear code to that of any of its cosets is proved.  ... 

Interference management via sliding-window superposition coding

Hosung Park, Young-Han Kim, Lele Wang
2014 2014 IEEE Globecom Workshops (GC Wkshps)  
The sliding-window superposition coding scheme achieves the performance of simultaneous decoding with pointto-point channel codes and low-complexity decoding.  ...  This paper provides a case study of how this conceptual coding scheme can be transformed to a practical coding technique for two-user Gaussian interference channels.  ...  Receiver i performs successive cancellation decoding of all superimposed layers from sender i and some superimposed layers from the other sender within a window length according to a predetermined decoding  ... 
doi:10.1109/glocomw.2014.7063559 dblp:conf/globecom/ParkKW14 fatcat:yylpbvskjzhbpobkbpas3cvyju

Two Models of Nonadaptive Group Testing for Designing Screening Experiments [article]

A.G. D'yachkov, A.J. Macula, D.C. Torney, P.A. Vilenkin
2014 arXiv   pre-print
The first model is called a search of defective supersets. The second model is called a search of defective subsets in the presence of inhibitors.  ...  We discuss two non-standard models of nonadaptive combinatorial search which develop the conventional disjunct search model for a small number of defective elements contained in a finite ground set or  ...  This completes the proof of the statement and also gives the decoding algorithm. Note that one can consider only such subsets I ′ for which V(I ′ ) r(X, p, I) = 0.  ... 
arXiv:1401.7508v1 fatcat:gdtb55wkhvhgfdfb2ef5skzwdu

Mobile Collaborative Video

Kiarash Amiri, Shih-Hsien Yang, Aditi Majumder, Fadi Kurdahi, Magda El Zarki
2014 IEEE transactions on circuits and systems for video technology (Print)  
In this paper we present a camera-based methodology for the alignment and synchronization of multiple projectors.  ...  A prototype system has been setup and used to test the proposed techniques.  ...  But in the superimposed setting, the images are overlaid on top of each other, and so are the QR codes. Thus, QR codes from multiple devices superimpose prohibiting the decoding of QR codes.  ... 
doi:10.1109/tcsvt.2014.2302523 fatcat:aenl4kloivcfvojdgfrcm6gz4q

Superimposed codes for the multiaccess binary adder channel

P.Z. Fan, M. Darnell, B. Honary
1995 IEEE Transactions on Information Theory  
It should be noted that the error-correcting ability of the disjunctive code constructed from the constant-weight code is not constant, but is a function of size IAl.  ...  Identifying m out of T ( m << T) users sharing a multiaccess adder channel can be achieved as follows: assign to each user one codeword from a superimposed code and the all-zero vector of length n.  ... 
doi:10.1109/18.391266 fatcat:wyzoehaqpvaoxc6pqt7fd3vszu

Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels [article]

Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Marvin Geiselhart, Stephan ten Brink
2020 arXiv   pre-print
Based on the interleave-division multipleaccess (IDMA) concept, we implement an iterative detection and decoding non-orthogonal multiple access (NOMA) receiver that benefits from a low complexity, while  ...  We further show the conceptual simplicity of the belief propagation (BP)-based decoder in a step-by-step illustration of its construction.  ...  Originally, the choice of frozen/non-frozen bit-channels was based on the assumption of using a successive cancellation (SC) decoder to decode the polar code [1] .  ... 
arXiv:2012.01075v2 fatcat:ckll7r4wqbf3tplcpgrn6fzg3u

Short Packet Structure for Ultra-Reliable Machine-type Communication: Tradeoff between Detection and Decoding [article]

Alexandru-Sabin Bana, Kasper Fløe Trillingsgaard, Petar Popovski, Elisabeth de Carvalho
2018 arXiv   pre-print
is a tradeoff between the resources spent for detection and decoding.  ...  Machine-type communication requires rethinking of the structure of short packets due to the coding limitations and the significant role of the control information.  ...  Note that the decoding error probability depends on Np and P and the detection error probability depends on ∆, Np, and P .  ... 
arXiv:1802.10407v2 fatcat:f3ysqewauzcs5p7mxv3juaapbi

A class of codes for a T active users out of N multiple-access communication system

P. Mathys
1990 IEEE Transactions on Information Theory  
It should be noted that the error-correcting ability of the disjunctive code constructed from the constant-weight code is not constant, but is a function of size IAl.  ...  Identifying m out of T ( m << T) users sharing a multiaccess adder channel can be achieved as follows: assign to each user one codeword from a superimposed code and the all-zero vector of length n.  ... 
doi:10.1109/18.59923 fatcat:7dkzgcdg6fbsnonsswo5mosenm

Interference Networks with General Message Sets: A Random Coding Scheme [article]

Reza K. Farsani, Farokh Marvasti
2011 arXiv   pre-print
For such a general scenario, an achievability scheme is presented using the random coding.  ...  Some benefits of the proposed achievability scheme are described. It is also shown that the resulting rate region is optimal for a class of orthogonal INs-GMS, which yields the capacity region.  ...  Each receiver decodes its respective codewords (the first one decodes , and the second one decodes , ) using a jointly typical decoder.  ... 
arXiv:1107.1839v1 fatcat:tbn7ju6zojgb5mc3zgjo3j7ueu

On LDPC codes for Gaussian interference channels

Shahrouz Sharifi, A. Korhan Tanc, Tolga M. Duman
2014 2014 IEEE International Symposium on Information Theory  
In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing lowdensity parity-check (LDPC) codes  ...  For the case of weak interference, it is shown that via the newly designed codes, a nontrivial rate pair is achievable, which is not attainable by single user codes with time-sharing.  ...  ACKNOWLEDGMENT Part of this publication, specifically Section 4, was made possible by NPRP grant 4-1293-5-213 from the Qatar National Research Fund (a member of Qatar Foundation).  ... 
doi:10.1109/isit.2014.6875182 dblp:conf/isit/SharifiTD14 fatcat:md6pbjuypjblvjq5hi4barlpza
« Previous Showing results 1 — 15 out of 11,518 results