Bibliografías temáticas / Uniquely decodable code / Artículos de revistas

Artículos de revistas sobre el tema "Uniquely decodable code"

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Uniquely decodable code.
Autor: Grafiati
Publicado: 6 de septiembre de 2023

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 20 mejores artículos de revistas para su investigación sobre el tema "Uniquely decodable code".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Resumen
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 before that the compression ratio can get quite close to Huffman/Arithmetic codes with an additional capability of providing direct access in compressed data, which is a missing feature in the regular Huffman codes. In this study we investigate non-UD codes in another dimension addressing the privacy of the high-entropy data. We particularly focus on such massive volumes, where typical examples are encoded video or similar multimedia files. Representation of such a volume with non–UD coding creates two elements as the disambiguation information and the payload, where decoding the original data from these elements becomes hard when one of them is missing. We make use of this observation for privacy concerns. and study the space consumption as well as the hardness of that decoding. We conclude that non-uniquely-decodable codes can be an alternative to selective encryption schemes that aim to secure only part of the data when data is huge. We provide a freely available software implementation of the proposed scheme as well.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

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

Texto completo
Resumen
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 the proposed decoder is almost as good as the maximum-likelihood (ML) decoder. In addition to that through simulations, we show that the proposed scheme can significantly improve the sum-rate capacity, which in turn can potentially improve overall throughput, as it needs only two time slots (TSs) to exchange information compared to the conventional methods.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

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

Texto completo
Resumen
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 formula given above, and it is tempting to say that the ith message "contains log(1=pi) bits of information." Shannon himself succumbed to this temptation [46, p. 399] when he wrote about entropy estimates and considers Basic English and James Joyces's book "Finnegan's Wake" as two extreme examples of high and low redundancy in English texts. But, strictly speaking, one can speak only of entropies of random variables, not of their individual values, and "Finnegan's Wake" is not a random variable, just a specific string. Can we define the amount of information in individual objects?
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
11

SHARMA, R., P. GUPTA y R. K. TUTEJA. "LOWER BOUNDS ON $L^t_{1:1}(D)$ IN TERMS OF RENYI ENTROPY". Tamkang Journal of Mathematics 22, n.º 4 (1 de diciembre de 1991): 335–42. http://dx.doi.org/10.5556/j.tkjm.22.1991.4622.

Texto completo
Resumen
In this paper we obtain the lower bounds for the exponentiated mean codeword length (as defined by Campbell [4]) for one-one codes of size $D$ by using the functions which represent possible transformations from one-one codes of size $D$ to uniquely decodable codes.
Los estilos APA, Harvard, Vancouver, ISO, etc.
12

Mashayekhi, Omid y Farokh Marvasti. "Uniquely Decodable Codes with Fast Decoder for Overloaded Synchronous CDMA Systems". IEEE Transactions on Communications 60, n.º 11 (noviembre de 2012): 3145–49. http://dx.doi.org/10.1109/tcomm.2012.081012.110178.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
13

Ahlswede, R. y V. B. Balakirsky. "Construction of uniquely decodable codes for the two-user binary adder channel". IEEE Transactions on Information Theory 45, n.º 1 (1999): 326–30. http://dx.doi.org/10.1109/18.746834.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
14

Yu, Qi-Yue, Ya-Tian Li, Wei-Xiao Meng y Wei Xiang. "Uniquely Decodable Codes for Physical-Layer Network Coding in Wireless Cooperative Communications". IEEE Systems Journal 13, n.º 4 (diciembre de 2019): 3956–67. http://dx.doi.org/10.1109/jsyst.2019.2891785.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
15

Woryna, Adam. "On the ratio of prefix codes to all uniquely decodable codes with a given length distribution". Discrete Applied Mathematics 244 (julio de 2018): 205–13. http://dx.doi.org/10.1016/j.dam.2018.02.026.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
16

Bross, S. I. y I. F. Blake. "Upper bound for uniquely decodable codes in a binary input N-user adder channel". IEEE Transactions on Information Theory 44, n.º 1 (1998): 334–40. http://dx.doi.org/10.1109/18.651062.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
17

Yu, Qi-Yue, Wei-Xiao Meng y Shu Lin. "Packet Loss Recovery Scheme with Uniquely-Decodable Codes for Streaming Multimedia over P2P Networks". IEEE Journal on Selected Areas in Communications 31, n.º 9 (septiembre de 2013): 142–54. http://dx.doi.org/10.1109/jsac.2013.sup.0513013.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
18

Shin, Jae Kyun y S. Krishnamurty. "On Identification and Canonical Numbering of Pin-Jointed Kinematic Chains". Journal of Mechanical Design 116, n.º 1 (1 de marzo de 1994): 182–88. http://dx.doi.org/10.1115/1.2919344.

Texto completo
Resumen
This paper deals with the development of a standard code for the unique representation of pin-jointed kinematic chains based on graph theory. Salient features of this method include the development of an efficient and robust algorithm for the identification of isomorphism in kinematic chains; the formulation of a unified procedure for the analysis of symmetry in kinematic chains; and the utilization of symmetry in the coding process resulting in the unique well-arranged numbering of the links. This method is not restricted to simple jointed kinematic chains only, and it can be applied to any kinematic chain which can be represented as simple graphs including open jointed and multiple jointed chains. In addition, the method is decodable as the original chain can be reconstructed unambiguously from the code values associated with the chains.
Los estilos APA, Harvard, Vancouver, ISO, etc.
19

Kiviluoto, Lasse y Patric R. J. Ostergard. "New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$". IEEE Transactions on Information Theory 53, n.º 3 (marzo de 2007): 1219–20. http://dx.doi.org/10.1109/tit.2006.890692.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
20

Xu, Jie, Zhiyong Zheng, Kun Tian y Man Chen. "Two properties of prefix codes and uniquely decodable codes". Designs, Codes and Cryptography, 20 de junio de 2023. http://dx.doi.org/10.1007/s10623-023-01253-1.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía