Results 281 to 290 of about 12,796,570 (330)

Causal source codes

IEEE Transactions on Information Theory, 1982
For a stationary memoryless source, let \(R_c(D)\) be the optimum rate for encoding the source with causal (i.e., non-anticipatory) encoders with respect to a single letter fidelity criterion at the distortion level \(D\), which the authors show to be the same whether block, sliding-block, or finite-state causal encoders are used.
David L. Neuhoff, R. Kent Gilbert
openaire   +1 more source

Source Code Summarization in the Era of Large Language Models

International Conference on Software Engineering
To support software developers in understanding and maintaining programs, various automatic (source) code summarization techniques have been proposed to generate a concise natural language summary (i.e., comment) for a given code snippet.
Weisong Sun, Yun Miao, Yuekang Li, Hongyu Zhang, Chunrong Fang, Yi Liu, Gelei Deng, Yang Liu, Zhenyu Chen   +8 more
semanticscholar   +1 more source

DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence

arXiv.org
We present DeepSeek-Coder-V2, an open-source Mixture-of-Experts (MoE) code language model that achieves performance comparable to GPT4-Turbo in code-specific tasks. Specifically, DeepSeek-Coder-V2 is further pre-trained from an intermediate checkpoint of
DeepSeek-AI, Qihao Zhu, Daya Guo, Zhihong Shao, Dejian Yang, Peiyi Wang, Runxin Xu, Y. Wu, Yukun Li, Huazuo Gao, Shirong Ma, Wangding Zeng, Xiao Bi, Zihui Gu, Hanwei Xu, Damai Dai, Kai Dong, Liyue Zhang, Y. Piao, Zhibin Gou, Zhenda Xie, Zhewen Hao, Bing-Li Wang, Jun-Mei Song, Deli Chen, Xin Xie, Kang Guan, Yu-mei You, A. Liu, Qiushi Du, Wenjun Gao, Xuan Lu, Qinyu Chen, Yaohui Wang, C. Deng, Jiashi Li, Chenggang Zhao, C. Ruan, Fuli Luo, W. Liang   +39 more
semanticscholar   +1 more source

Merge source coding

2009 IEEE International Symposium on Information Theory, 2009
We show that any comparison-based merging algorithm can be naturally mapped into a source coder via a conversion function introduced here. By applying this function over some well known merging algorithms, namely Binary Merging and Recursive Merging, we show that they are closely related to a runlength-based coder with Rice coding and to the Binary ...
Bruno Tenório Ávila, Eduardo Sany Laber   +1 more
openaire   +1 more source

Permutation codes for sources

IEEE Transactions on Information Theory, 1972
Summary: Source encoding techniques based on permutation codes are investigated. For a broad class of distortion measures it is shown that optimum encoding of a source permutation code is easy to instrument even for very long block lengths. Also, the nonparametric nature of permutation encoding is well suited to situations involving unknown source ...
Toby Berger, Frederick Jelinek, Jack K. Wolf   +2 more
openaire   +2 more sources

Source code plagiarism

Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces, 2009
Learning programming languages and developing software is important part of curricula at many educational institutions. Directly connected to that is a peer-to-peer sharing of program's source codes which is not always allowed. The article discusses the problem of plagiarism, especially the source code plagiarism and presents an excerpt of the results ...
Dejan Sraka, Branko Kaucic
openaire   +1 more source

The source coding game

IEEE Transactions on Information Theory, 1971
The encoding of a source whose probability distribution varies arbitrarily from letter to letter is considered. The problem is formulated as a two-person statistical game. The exponential rate of growth with block length of the minimum number of codewords needed to achieve a specified fidelity with respect to a single-letter distortion measure is ...
openaire   +2 more sources

Code detection in turbo source coding

IEEE Communications Letters, 2006
We consider the lossless compression of binary memoryless sources using a library of turbo codes. The message is compressed by each code and the best result along with the index of the applied code is sent to the decoder. Instead of transmitting the code index, we find a criterion to detect the code index using the transmitted parities.
Javad Haghighat, M. Reza Soleymani, Walaa Hamouda   +2 more
openaire   +1 more source

An algorithm for source coding

IEEE Transactions on Information Theory, 1972
We derive a simple algorithm for the ranking of binary sequences of length n and weight w . This algorithm is then used for source encoding a memoryless binary source that generates O's with probability q and l's with probability p = 1 - q .
openaire   +2 more sources

On the adaptive source coding

1991
We compare adaptive source coding algorithms. Description of the Huffman-Gallager algorithm can use a transition diagram were the tree leaves merge with its root. We show that the Lempel-Ziv algorithm can be used as a means for constructing a diagram of same shape.
Gerard Battail, Mauro Guazzo
openaire   +1 more source