Log in

Relevant bibliographies by topics / Uniquely decodable code

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Uniquely decodable code'

Author: Grafiati

Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Uniquely decodable code.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Uniquely decodable code"

1

Austrin, Per, Petteri Kaski, Mikko Koivisto, and Jesper Nederlof. "Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs." IEEE Transactions on Information Theory 64, no. 2 (2018): 1368–73. http://dx.doi.org/10.1109/tit.2017.2688378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Külekci, Muhammed Oğuzhan, and Yasin Öztürk. "Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation." Algorithms 12, no. 4 (2019): 78. http://dx.doi.org/10.3390/a12040078.

Full text

Abstract:

Non-uniquely-decodable (non-UD) codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non–prefix–free codes, where a code-word can be a prefix of other(s), and thus, the code-word boundary information is essential for correct decoding. Due to their inherent unique decodability problem, such non-UD codes have not received much attention except a few studies, in which using compressed data structures to represent the disambiguation information efficiently had been previously proposed. It had been shown befor

APA, Harvard, Vancouver, ISO, and other styles

3

Kulhandjian, Michel, Claude D’Amours, and Hovannes Kulhandjian. "Multiway Physical-Layer Network Coding via Uniquely Decodable Codes." Wireless Communications and Mobile Computing 2018 (June 28, 2018): 1–8. http://dx.doi.org/10.1155/2018/2034870.

Full text

Abstract:

We focus on a multiway relay channel (MWRC) network where two or more users simultaneously exchange information with each other through the help of a relay node. We propose for the first time to apply ternary uniquely decodable (UD) code sets that we have developed to allow each user to uniquely recover the information bits from the noisy channel environment. One of the key features of the proposed scheme is that it utilizes a very simple decoding algorithm, which requires only a few logical comparisons. Simulation results in terms of bit error rate (BER) demonstrate that the performance of th

APA, Harvard, Vancouver, ISO, and other styles

4

Woryna, Adam. "On the set of uniquely decodable codes with a given sequence of code word lengths." Discrete Mathematics 340, no. 2 (2017): 51–57. http://dx.doi.org/10.1016/j.disc.2016.08.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

van den Braak, P. C., and H. van Tilborg. "A family of good uniquely decodable code pairs for the two-access binary adder channel." IEEE Transactions on Information Theory 31, no. 1 (1985): 3–9. http://dx.doi.org/10.1109/tit.1985.1057004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Romashchenko, Andrei, Alexander Shen, and Marius Zimand. "27 Open Problems in Kolmogorov Complexity." ACM SIGACT News 52, no. 4 (2021): 31–54. http://dx.doi.org/10.1145/3510382.3510389.

Full text

Abstract:

This formula can be informally read as follows: the ith messagemi brings us log(1=pi) "bits of information" (whatever this means), and appears with frequency pi, so H is the expected amount of information provided by one random message (one sample of the random variable). Moreover, we can construct an optimal uniquely decodable code that requires about H (at most H + 1, to be exact) bits per message on average, and it encodes the ith message by approximately log(1=pi) bits, following the natural idea to use short codewords for frequent messages. This fits well the informal reading of the formu

APA, Harvard, Vancouver, ISO, and other styles

7

Vanroose, P., and E. C. van der Meulen. "Uniquely decodable codes for deterministic relay channels." IEEE Transactions on Information Theory 38, no. 4 (1992): 1203–12. http://dx.doi.org/10.1109/18.144701.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Li, Yatian, Tianwen Geng, and Shijie Gao. "Improve the throughput of M-to-1 free-space optical systems by employing uniquely decodable codes." Chinese Optics Letters 21, no. 3 (2023): 030603. http://dx.doi.org/10.3788/col202321.030603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Singh, Amiya, Poonam Singh, Arash Amini, and Farokh Marvasti. "Set of uniquely decodable codes for overloaded synchronous CDMA." IET Communications 10, no. 10 (2016): 1236–45. http://dx.doi.org/10.1049/iet-com.2015.0819.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ni, J., and B. Honary. "System state-independent-unique-decodable CCMA codes." IEE Proceedings I Communications, Speech and Vision 140, no. 3 (1993): 185. http://dx.doi.org/10.1049/ip-i-2.1993.0028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Uniquely decodable code"

1

Wiman, Mårten. "Improved Constructions of Unbalanced Uniquely Decodable Code Pairs." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210869.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ni, Jian. "Connectivity, dynamic performance of random radio networks & state independent uniquely decodable codes, codeword synchronisation of collaborative coding multiple access communications." Thesis, University of Warwick, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282534.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Liu, Chin-Fu, and 劉勁甫. "Analysis and Practice of Uniquely Decodable One-to-One Code." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/99031796479112363191.

Full text

Abstract:

碩士<br>國立交通大學<br>電信工程研究所<br>101<br>In this thesis, we consider the so-called uniquely decodable one-to-one code (UDOOC) that is formed by inserting a “comma” indicator, termed the unique word (UW), between consecutive one-to-one codewords for separation. Along this research direction, we first investigate the general combinatorial properties of UDOOCs, in particular the enumeration of UDOOC codewords for any (finite) codeword length. Based on the obtained formula on the number of length-n codewords for a given UW, the average codeword length of the optimal UDOOC for a given source statistics ca

APA, Harvard, Vancouver, ISO, and other styles

4

Shivkumar, K. M. "On Some Questions Involving Prefix Codes." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/4719.

Full text

Abstract:

Let A be a finite alphabet and A be the set of all finite sequences of the elements of A. A word is any member of A . A prefix code X is a set of words satisfying the prefix property, i.e., no word in the set is a prefix of any other word in the set. If X is defined as the collection of all concatenations of the words of X, then it can be seen that each of its elements can be expressed as a concatenation of the words of X in a unique manner. Any subset of A possessing this property is called a uniquely decodable code and the prefix codes constitute an important subclass of uniquely dec

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Uniquely decodable code"

1

Ni, Jian. Connectivity, dynamic performance of random radio networks and state independent uniquely decodable codes: Codeword synchronisation of collaborative coding multiple access communications. typescript, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Uniquely decodable code"

1

Belal, Ahmed A. "A More General Optimization Problem for Uniquely Decodable Codes." In Discrete Structural Optimization. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-85095-0_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Uniquely decodable code"

1

Kulhandjian, Michel, and Dimitris A. Pados. "Uniquely decodable code-division via augmented Sylvester-Hadamard matrices." In 2012 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2012. http://dx.doi.org/10.1109/wcnc.2012.6214390.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Austrin, Per, Petteri Kaski, Mikko Koivisto, and Jesper Nederlof. "Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs." In 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, 2016. http://dx.doi.org/10.1109/isit.2016.7541316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Liu, Chin-Fu, Hsiao-feng Francis Lu, and Po-Ning Chen. "Analysis and practice of uniquely decodable one-to-one code." In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lu, Shan, Wei Hou, Jun Cheng, and Hiroshi Kamabe. "A New Kind of Nonbinary Uniquely Decodable Codes with Arbitrary Code Length for Multiple-Access Adder Channel." In 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kulhandjian, Michel, Claude D'Amours, and Hovannes Kulhandjian. "Uniquely Decodable Ternary Codes for Synchronous CDMA Systems." In 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). IEEE, 2018. http://dx.doi.org/10.1109/pimrc.2018.8580794.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kulhandjian, Michel, Hovannes Kulhandjian, and Claude D'Amours. "Uniquely Decodable Ternary Codes via Augmented Sylvester-Hadamard Matrices." In 2021 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom). IEEE, 2021. http://dx.doi.org/10.1109/blackseacom52164.2021.9527898.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kulekci, M. Oguzhan. "Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees." In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620570.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Shaltiel, Ronen, and Jad Silbak. "Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity." In STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing. ACM, 2021. http://dx.doi.org/10.1145/3406325.3451048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Singh, A., and P. Singh. "Uniquely decodable codes for overloaded synchronous CDMA with two sets of orthogonal signatures." In 2014 Annual IEEE India Conference (INDICON). IEEE, 2014. http://dx.doi.org/10.1109/indicon.2014.7030549.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lu, Shan, Wei Hou, Jun Cheng, and Hiroshi Kamabe. "Recursive Construction of k-Ary Uniquely Decodable Codes for Multiple-Access Adder Channel." In 2018 International Symposium on Information Theory and Its Applications (ISITA). IEEE, 2018. http://dx.doi.org/10.23919/isita.2018.8664318.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!