Filters








151 Hits in 6.3 sec

Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing

Elena Egorova, Marcel Fernandez, Grigory Kabatiansky, Moon Ho Lee
2018 Designs, Codes and Cryptography  
Our approach is based on the theory of the signature codes for multiple access channels, mainly, for a weighted noisy adder channel.  ...  The corresponding multimedia fingerprinting codes allow to trace the entire coalition of pirates. The codes provide significantly better rate than previously known multimedia fingerprinting schemes.  ...  Hence, multimedia fingerprinting codes capable to trace the whole coalition of size t are in fact the same as t-signature codes for the weighted adder channel, and the number of users M equals to the cardinality  ... 
doi:10.1007/s10623-018-0580-4 fatcat:36o4ehxebvcthpdsmbmaobcgxy

Some families of zero- error block codes for the two-user binary adder channel with feedback

Zhen Zhang, T. Berger, J. Massey
1987 IEEE Transactions on Information Theory  
Two families of zero-error block codes are given for the case in which only one of the two senders receives feedback about the channel output.  ...  Families of zero-error codes for the real binary adder channel with feedback that achieve high rate pairs are introduced.  ...  Some Families of Zero-Error Block Codes for the Two-User Binary Adder Channel with Feedback ZHEN ZHANG, TOBY BERGER, FELLOW, IEEE, AND JAMES I.,. MASSEY, FELLOW, IEEE .  ... 
doi:10.1109/tit.1987.1057358 fatcat:a3ph2wndpngf5oymzcojdxzjgy

Functional-Decode-Forward for the General Discrete Memoryless Two-Way Relay Channel [article]

Lawrence Ong, Christopher M. Kellett, Sarah J. Johnson
2011 arXiv   pre-print
We consider the general discrete memoryless two-way relay channel, where two users exchange messages via a relay, and propose two functional-decode-forward coding strategies for this channel.  ...  Functional-decode-forward involves the relay decoding a function of the users' messages rather than the individual messages themselves.  ...  binary adder channels, [2] for finite field adder channels, and [3] , [4] for AWGN channels).  ... 
arXiv:1111.3396v1 fatcat:krcbbcbog5hdlatj3ivmh3mocm

Sign-Compute-Resolve for Random Access [article]

Jasper Goseling, Cedomir Stefanovic, Petar Popovski
2014 arXiv   pre-print
Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users.  ...  For each user this information consists of the data that the user wants to communicate as well as the user's signature.  ...  The work was supported in part by the Danish Council for Independent Research (DFF), grant no. 11-105159 "Dependable Wireless Bits for Machine-to-Machine (M2M) Communications" and grant no.  ... 
arXiv:1409.6902v1 fatcat:gzqeaj3n5fb5vj7kxrerll6yte

Sign-compute-resolve for random access

Jasper Goseling, Cedomir Stefanovic, Petar Popovski
2014 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
Upon occurrence of a collision, physicallayer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users.  ...  For each user this information consists of the data that the user wants to communicate as well as the user's signature.  ...  The work was supported in part by the Danish Council for Independent Research (DFF), grant no. 11-105159 "Dependable Wireless Bits for Machine-to-Machine (M2M) Communications" and grant no.  ... 
doi:10.1109/allerton.2014.7028520 dblp:conf/allerton/GoselingSP14 fatcat:zorbkmhtxjc7xjxxyjdwbzr73y

The Capacity Region of the Restricted Two-Way Relay Channel with Any Deterministic Uplink

Lawrence Ong, Sarah J. Johnson
2012 IEEE Communications Letters  
This paper considers the two-way relay channel (TWRC) where two users communicate via a relay.  ...  For the restricted TWRC where the uplink from the users to the relay is any deterministic function and the downlink from the relay to the users is any arbitrary channel, the capacity region is obtained  ...  The capacity region of the two-way relay channel was found for the case where the uplink and the downlink are both binary symmetric adder channels [2] .  ... 
doi:10.1109/lcomm.2012.011312.112198 fatcat:6x2obvmzmvfrxhdbjp4tcthimi

Optimization Algorithms for Improving the Performance of Permutation Trellis Codes [article]

Oluwafemi Kolade, Mulundumina Shimaponda-Nawa, Daniel J.J. Versfeld, Ling Cheng
2020 arXiv   pre-print
In a concatenated code such as PTC, the Viterbi decoder for the outer convolutional code provides maximum likelihood decoding.  ...  From the results, a reasonable trade-off between the complexity and coding gain is observed for a noisy channel such as the PLC channel.  ...  Laboratory (DigiMine), Wits Mining Institute (WMI), University of the Witwatersrand, Johannesburg, South Africa.  ... 
arXiv:2004.08907v3 fatcat:k7wlienchffghhq3i76uvagmye

Massive MIMO Unsourced Random Access [article]

Alexander Fengler, Giuseppe Caire, Peter Jung, Saeid Haghighatshoar
2019 arXiv   pre-print
Our coding approach borrows the concatenated coding idea from Amalladinne et. al., combined with a novel non-Bayesian 'activity detection' algorithm for massive MIMO random access channels, that outperforms  ...  We show that the required transmit E_b/N_0 for reliable communication can be made arbitrarily small as the number of receiver antennas M grows sufficiently large.  ...  Motivates by Polyanskiy's results, [2] proposed a coding scheme for the real-adder AWGN channel (1), based on partitioning the transmission slot into subslots, and letting each active user send a codeword  ... 
arXiv:1901.00828v1 fatcat:6ssl6xsmtvbebjffu5ul52mo2q

Signature codes for weighted binary adder channel and multimedia fingerprinting [article]

Jinping Fan, Yujie Gu, Masahiro Hachimori, Ying Miao
2019 arXiv   pre-print
In this paper, we study the signature codes for weighted binary adder channel (WbAC) and collusion-resistant multimedia fingerprinting.  ...  Let A(n,t) denote the maximum cardinality of a t-signature code of length n, and A(n,w,t) denote the maximum cardinality of a t-signature code of length n and constant weight w.  ...  Itzhak Tamo of Tel Aviv University and Prof. Zhiying Wen of Tsinghua University for their insightful discussions on Section V.  ... 
arXiv:1905.10180v1 fatcat:zegimeow6reg5pbfffmea7bud4

Parallel error correcting codes

R. Ahlswede, B. Balkenhol, Ning Cai
2002 IEEE Transactions on Information Theory  
An exception here is the adder channel, one of the simplest MAC (c.f. [11] for a survey), which has been studied for error correcting and also for error-free (λ = 0) codes.  ...  In the context of multi-user Information Theory an IP-code is used in multiple access channel (MAC), a channel with two (or more) independent senders and one receiver, whereas a non-independent P-code  ... 
doi:10.1109/18.992800 fatcat:uq3zamfosrg5teo4hrt4tuvnpq

Optimal Transmission Strategy and Explicit Capacity Region for Broadcast Z Channels

Bike Xie, M. Griot, A.I.V. Casado, R.D. Wesel
2008 IEEE Transactions on Information Theory  
This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user.  ...  Specifically, the information messages corresponding to each user are encoded independently and the OR of these two encoded streams is transmitted.  ...  Nonlinear-Turbo Codes for the Two-User Broadcast Z Channel In this section we show a practical implementation of the transmission strategy for the two-user broadcast Z channel.  ... 
doi:10.1109/tit.2008.928298 fatcat:jot3gb5io5fhtp3dqvisnk2qwu

Finite signal-set capacity of two-user Gaussian Multiple Access Channel

J. Harshan, B. Sundar Rajan
2008 2008 IEEE International Symposium on Information Theory  
When both the users are equipped with the same code alphabet, it is shown that, rotation of one of the user's alphabets by an appropriate angle can make the new pair of alphabets not only uniquely decodable  ...  The capacity region of a two-user Gaussian Multiple Access Channel (GMAC) with complex finite input alphabets and continuous output alphabet is studied.  ...  For the given transmit power of each user and the number of points in the code alphabets, we address the problems related to designing alphabet pairs, (S 1 , S 2 ) for a two -user GMAC which maximally  ... 
doi:10.1109/isit.2008.4595178 dblp:conf/isit/HarshanR08 fatcat:ewpg2loa45hztbzuxvnfmfanqa

Uniformly Bounded State Estimation over Multiple Access Channels [article]

Ghassen Zafzouf, Girish N. Nair, Farhad Farokhi
2022 arXiv   pre-print
This paper addresses the problem of distributed state estimation via multiple access channels (MACs).  ...  We consider a scenario where two encoders are simultaneously communicating their measurements through a noisy channel.  ...  NUMERICAL EXAMPLE: THE BINARY ADDER CHANNEL (BAC) A. Zero-Error Capacity Region of the BAC A well-known example of a MAC in the literature is the binary adder channel (BAC).  ... 
arXiv:2002.03294v2 fatcat:2ti7z4r72vgyrh7v5dcbd5yghy

Optimal Transmission Strategy and Explicit Capacity Region for Broadcast Z Channels [article]

Bike Xie, Miguel Griot, Andres I. Vila Casado, Richard D. Wesel
2008 arXiv   pre-print
This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user.  ...  Specifically, the information messages corresponding to each user are encoded independently and the OR of these two encoded streams is transmitted.  ...  NONLINEAR-TURBO CODES FOR THE TWO-USER BROADCAST Z CHANNEL In this section we show a practical implementation of the transmission strategy for the two-user broadcast Z channel.  ... 
arXiv:0810.3226v1 fatcat:mlrfysmunvfofiszwc3lhooqoy

Coding for Two-User SISO and MIMO Multiple Access Channels [article]

J. Harshan, B. Sundar Rajan
2009 arXiv   pre-print
Hence, such a labelling scheme can be used systematically to construct trellis code pairs for a two-user GMAC to achieve sum rates close to the sum capacity of the channel.  ...  When both the users employ the same code alphabet, it is well known that an appropriate rotation between the alphabets provides unique decodability to the receiver.  ...  of both users can be uniquely decoded.  ... 
arXiv:0901.0168v3 fatcat:cdjalfreanasdnrwja367nv6pe
« Previous Showing results 1 — 15 out of 151 results