Добірка наукової літератури з теми "Uniquely decodable code"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Uniquely decodable code".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Uniquely decodable code"
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 (February 2018): 1368–73. http://dx.doi.org/10.1109/tit.2017.2688378.
Повний текст джерела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 (April 17, 2019): 78. http://dx.doi.org/10.3390/a12040078.
Повний текст джерела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.
Повний текст джерелаWoryna, Adam. "On the set of uniquely decodable codes with a given sequence of code word lengths." Discrete Mathematics 340, no. 2 (February 2017): 51–57. http://dx.doi.org/10.1016/j.disc.2016.08.013.
Повний текст джерела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 (January 1985): 3–9. http://dx.doi.org/10.1109/tit.1985.1057004.
Повний текст джерелаRomashchenko, Andrei, Alexander Shen, and Marius Zimand. "27 Open Problems in Kolmogorov Complexity." ACM SIGACT News 52, no. 4 (December 20, 2021): 31–54. http://dx.doi.org/10.1145/3510382.3510389.
Повний текст джерелаVanroose, P., and E. C. van der Meulen. "Uniquely decodable codes for deterministic relay channels." IEEE Transactions on Information Theory 38, no. 4 (July 1992): 1203–12. http://dx.doi.org/10.1109/18.144701.
Повний текст джерела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.
Повний текст джерелаSingh, Amiya, Poonam Singh, Arash Amini, and Farokh Marvasti. "Set of uniquely decodable codes for overloaded synchronous CDMA." IET Communications 10, no. 10 (July 1, 2016): 1236–45. http://dx.doi.org/10.1049/iet-com.2015.0819.
Повний текст джерела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.
Повний текст джерелаДисертації з теми "Uniquely decodable code"
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.
Повний текст джерела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.
Повний текст джерелаLiu, Chin-Fu, and 劉勁甫. "Analysis and Practice of Uniquely Decodable One-to-One Code." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/99031796479112363191.
Повний текст джерела國立交通大學
電信工程研究所
101
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 can be computed. Upper bounds on the average codeword length of UDOOCs are next established. The analysis on bounds of the average codeword length then leads to two asymptotic bounds on ultimate per-letter average codeword length, one of which is achievable and hence tight for a certain source statistics and UW, and the other of which proves the achievability of source entropy rate of UDOOCs when both the block size of source letters for UDOOC compression and UW length go to infinity. Efficient encoding and decoding algorithms for UDOOCs are subsequently given. Numerical results show that when grouping three English letters as a block, the UDOOCs with UW = 0001, 0000, 000001 and 000000 can respectively reach the compression rates of 3.531, 4.089, 4.115 and 4.709 bits per English letter (with the lengths of UWs included), where the source stream to be compressed is the book titled Alice’s Adventures in Wonderland. In comparison with the first-order Huffman code, the second-order Huffman code, the third-order Huffman code and the Lembel-Ziv code, which respectively achieve the compression of 3.940, 3.585, 3.226 and 6.028 bits per single English letter, the proposed UDOOCs can potentially in comparable compression rate to the Huffman code under similar decoding complexity and yield a better average codeword length than that of the Lempel-Ziv code, thereby confirming the practicability of the simple idea of separating OOC codewords by UWs.
Shivkumar, K. M. "On Some Questions Involving Prefix Codes." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/4719.
Повний текст джерелаКниги з теми "Uniquely decodable code"
Ni, Jian. Connectivity, dynamic performance of random radio networks and state independent uniquely decodable codes: Codeword synchronisation of collaborative coding multiple access communications. [s.l.]: typescript, 1994.
Знайти повний текст джерелаЧастини книг з теми "Uniquely decodable code"
Belal, Ahmed A. "A More General Optimization Problem for Uniquely Decodable Codes." In Discrete Structural Optimization, 239–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/978-3-642-85095-0_24.
Повний текст джерелаТези доповідей конференцій з теми "Uniquely decodable code"
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3406325.3451048.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела