Log in

Relevant bibliographies by topics / Optimal coding / Journal articles

To see the other types of publications on this topic, follow the link: Optimal coding.

Journal articles on the topic 'Optimal coding'

Author: Grafiati

Published: 28 May 2022

Last updated: 30 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Optimal coding.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Long, Dongyang, Weijia Jia †, and Ming Li ‡. "Optimal synchronous coding." International Journal of Computer Mathematics 81, no. 8 (2004): 931–41. http://dx.doi.org/10.1080/00207160410001715285.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Peskin, Charles S. "Optimal random coding." Communications on Pure and Applied Mathematics 39, no. 1 (1986): 69–73. http://dx.doi.org/10.1002/cpa.3160390104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lin, James, and Richard W. Waguespack. "Coding for Optimal Payment (Correct Coding 2022 for Otolaryngology)." Otolaryngologic Clinics of North America 55, no. 1 (2022): 137–44. http://dx.doi.org/10.1016/j.otc.2021.07.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Vinokurov, V. A., and V. A. Sadovnichii. "Optimal coding of continuous functions." Doklady Mathematics 79, no. 3 (2009): 421–23. http://dx.doi.org/10.1134/s1064562409030326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Korneichuk, N. P. "Optimal coding of vector-functions." Ukrainian Mathematical Journal 40, no. 6 (1989): 621–27. http://dx.doi.org/10.1007/bf01057180.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

A, Bharathi, Siva C, Suguna Angamuthu, and Thangamani M. "Multi Objective Concerned Network Coding Technique for Optimal Data Transmission." Webology 18, no. 05 (2021): 1191–203. http://dx.doi.org/10.14704/web/v18si05/web18300.

Full text

Abstract:

The Internet of Things (IoT) seems to developed in the real-world scenario due to increased utilization of sensor driven technologies. There are various research works has been proposed earlier for the network coding to ensure the reliable data transmission. However, existing research techniques doesn’t focus on the reliable route path selection which might affect the rate of data transmission. These issues are focused in the proposed research method by introducing the method namely Multi-Objective concerned Network Coding Technique (MO-NCT). In this work initially multicast tree construction

APA, Harvard, Vancouver, ISO, and other styles

7

CALUDE, CRISTIAN S., HAJIME ISHIHARA, and TAKESHI YAMAGUCHI. "CODING WITH MINIMAL PROGRAMS." International Journal of Foundations of Computer Science 12, no. 04 (2001): 479–89. http://dx.doi.org/10.1142/s0129054101000606.

Full text

Abstract:

According to the Algorithmic Coding Theorem, minimal programs of any universal machine are prefix-codes asymptotically optimal (i.e. optimal up to at most an additive, unknown constant) with respect to the machine algorithmic probabilities. A stronger version of this result will be proven for a class of machines, not necessarily universal, and any semi-distribution. Furthermore, minimal programs with respect to universal machines will be shown to be almost optimal (i.e. optimal up to an additive constant less than or equal to 2) for any semi-computable semi-distribution. Finally, a complete ch

APA, Harvard, Vancouver, ISO, and other styles

8

Yu, Hou, and Fenfei Hou. "Novel Architecture of PON based Two-dimensional Pre-coding." Journal of Optical Communications 40, no. 2 (2019): 139–42. http://dx.doi.org/10.1515/joc-2017-0025.

Full text

Abstract:

Abstract This paper presents a PON link failure monitoring scheme based on optical pre-coding polling which establishes link failure optimal judgment performance model by using of Neyman-Pearson Criterion. The simulation results show that with the increase of the distance from the user, the NTC becomes wider in the range of optimal judgment, which is easier to achieve optimal judgment; the number of network users is reduced from 128 to 16, NTC in the range of optimal judgment becomes wider; When the pulse width is between ${10^{ - 11}}s \lt Tc \lt {10^{ - 9}}s$, it is relatively easy to get th

APA, Harvard, Vancouver, ISO, and other styles

9

Abeyesinghe, A., P. Hayden, G. Smith, and A. J. Winter. "Optimal Superdense Coding of Entangled States." IEEE Transactions on Information Theory 52, no. 8 (2006): 3635–41. http://dx.doi.org/10.1109/tit.2006.878174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lakhani, G. "Optimal Huffman Coding of DCT Blocks." IEEE Transactions on Circuits and Systems for Video Technology 14, no. 4 (2004): 522–27. http://dx.doi.org/10.1109/tcsvt.2004.825565.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Schuster, G. M., G. Melnikov, and A. K. Katsaggelos. "Operationally optimal vertex-based shape coding." IEEE Signal Processing Magazine 15, no. 6 (1998): 91–108. http://dx.doi.org/10.1109/79.733498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Wang, Taotao, Soung Chang Liew, and Long Shi. "Optimal Rate-Diverse Wireless Network Coding." IEEE Transactions on Communications 65, no. 6 (2017): 2411–26. http://dx.doi.org/10.1109/tcomm.2017.2672662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Barman, Siddharth, and Omar Fawzi. "Algorithmic Aspects of Optimal Channel Coding." IEEE Transactions on Information Theory 64, no. 2 (2018): 1038–45. http://dx.doi.org/10.1109/tit.2017.2696963.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Xie, J., L. T. Chia, and B. S. Lee. "Optimal bit allocation for FGS coding." Electronics Letters 40, no. 16 (2004): 983. http://dx.doi.org/10.1049/el:20045303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Dunscombe, E., and F. C. Piper. "Optimal interleaving scheme for convolutional coding." Electronics Letters 25, no. 22 (1989): 1517. http://dx.doi.org/10.1049/el:19891018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Poulalhon, Dominique, and Gilles Schaeffer. "Optimal Coding and Sampling of Triangulations." Algorithmica 46, no. 3-4 (2006): 505–27. http://dx.doi.org/10.1007/s00453-006-0114-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Aghagolzadeh, S., and O. K. Ersoy. "Optimal adaptive multistage image transform coding." IEEE Transactions on Circuits and Systems for Video Technology 1, no. 4 (1991): 308–17. http://dx.doi.org/10.1109/76.120770.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Wu, Xiaolin, and Yonggang Fang. "Visual coding by optimal graph-coloring." Visual Computer 10, no. 1 (1993): 54–61. http://dx.doi.org/10.1007/bf01905531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Yarus, Michael. "Optimal Evolution of the Standard Genetic Code." Journal of Molecular Evolution 89, no. 1-2 (2021): 45–49. http://dx.doi.org/10.1007/s00239-020-09984-8.

Full text

Abstract:

AbstractThe Standard Genetic Code (SGC) exists in every known organism on Earth. SGC evolution via early unique codon assignment, then later wobble, yields coding resembling the near-universal code. Below, later wobble is shown to also create an optimal route to accurate codon assignment. Time of optimal codon assignment matches the previously defined mean time for ordered coding, exhibiting ≥ 90% of SGC order. Accurate evolution is also accessible, sufficiently frequent to appear in populations of 103 to 104 codes. SGC-like coding capacity, code order, and accurate assignments therefore arise

APA, Harvard, Vancouver, ISO, and other styles

20

Alnwaimi, Ghassan, Hatem Boujemaa, and Kamran Arshad. "Optimal Packet Length for Free-Space Optical Communications with Average SNR Feedback Channel." Journal of Computer Networks and Communications 2019 (May 16, 2019): 1–8. http://dx.doi.org/10.1155/2019/4703284.

Full text

Abstract:

In this article, a method to enhance data rates of free-space optical (FSO) systems using packet length optimization is proposed. The average signal-to-noise ratio (ASNR) is measured at the receiver and sent back to the transmitter to optimize packet length. In addition, the length of packet is optimized to enhance the average throughput. We concluded that packet length can be reduced at low ASNR. However, packet length should be increased at higher values of received ASNR. For each ASNR, we also choose the optimal modulation and coding scheme (MCS) and optimal packet length to maximize the th

APA, Harvard, Vancouver, ISO, and other styles

21

Liu, Jianyi, Cong Zhang, Ru Zhang, Yi Li, and Jie Cheng. "A video steganalysis method based on coding cost variation." International Journal of Distributed Sensor Networks 17, no. 2 (2021): 155014772199273. http://dx.doi.org/10.1177/1550147721992730.

Full text

Abstract:

Aiming at the problems existing in existing steganalysis algorithms, this article proposes Motion Vector Coding Cost Change video steganalysis features based on Improved Motion Vector Reversion-Based features and Subtractive Probability of Coding Cost Optimal Matching features based on Subtractive Probability of Optimal Matching features from the perspective of the change of coding cost. Motion Vector Coding Cost Change features can be well consistent with the coding cost before recoding by analyzing the sub-pixel coding cost of recoding. By counting the sub-pixel coding costs of motion vector

APA, Harvard, Vancouver, ISO, and other styles

22

Lee, J. B., J. S. Cho, and A. Eleftheriadis. "Optimal buffered compression and coding mode selection for MPEG-4 shape coding." IEEE Transactions on Image Processing 10, no. 5 (2001): 686–700. http://dx.doi.org/10.1109/83.918562.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Kwon, Kon-Woo. "Optimal bus coding for OR-chained buses." IEICE Electronics Express 18, no. 3 (2021): 20200378. http://dx.doi.org/10.1587/elex.18.20200378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Tkacik, G., J. S. Prentice, V. Balasubramanian, and E. Schneidman. "Optimal population coding by noisy spiking neurons." Proceedings of the National Academy of Sciences 107, no. 32 (2010): 14419–24. http://dx.doi.org/10.1073/pnas.1004906107.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ahlswede, R., and A. Kaspi. "Optimal coding strategies for certain permuting channels." IEEE Transactions on Information Theory 33, no. 3 (1987): 310–14. http://dx.doi.org/10.1109/tit.1987.1057313.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hiroshima, Tohya. "Optimal dense coding with mixed state entanglement." Journal of Physics A: Mathematical and General 34, no. 35 (2001): 6907–12. http://dx.doi.org/10.1088/0305-4470/34/35/316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Zhang, Guo-Feng. "Effects of anisotropy on optimal dense coding." Physica Scripta 79, no. 1 (2008): 015001. http://dx.doi.org/10.1088/0031-8949/79/01/015001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Romney, A. K., and C. C. Chiao. "Functional computational model for optimal color coding." Proceedings of the National Academy of Sciences 106, no. 25 (2009): 10376–81. http://dx.doi.org/10.1073/pnas.0904688106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Nygaard, R., G. Melnikov, and A. K. Katsaggelos. "A rate distortion optimal ECG coding algorithm." IEEE Transactions on Biomedical Engineering 48, no. 1 (2001): 28–40. http://dx.doi.org/10.1109/10.900246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Abbott, L. F., and Sean X. Luo. "A step toward optimal coding in olfaction." Nature Neuroscience 10, no. 11 (2007): 1342–43. http://dx.doi.org/10.1038/nn1107-1342.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

BREJOVÁ, BROŇA, DANIEL G. BROWN, and TOMÁŠ VINAŘ. "OPTIMAL SPACED SEEDS FOR HOMOLOGOUS CODING REGIONS." Journal of Bioinformatics and Computational Biology 01, no. 04 (2004): 595–610. http://dx.doi.org/10.1142/s0219720004000326.

Full text

Abstract:

Optimal spaced seeds were developed as a method to increase sensitivity of local alignment programs similar to BLASTN. Such seeds have been used before in the program PatternHunter, and have given improved sensitivity and running time relative to BLASTN in genome–genome comparison. We study the problem of computing optimal spaced seeds for detecting homologous coding regions in unannotated genomic sequences. By using well-chosen seeds, we are able to improve the sensitivity of coding sequence alignment over that of TBLASTX, while keeping runtime comparable to BLASTN. We identify good seeds by

APA, Harvard, Vancouver, ISO, and other styles

32

Qiu, Liang, An Min Wang, and Xiao San Ma. "Optimal dense coding with thermal entangled states." Physica A: Statistical Mechanics and its Applications 383, no. 2 (2007): 325–30. http://dx.doi.org/10.1016/j.physa.2007.05.021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Rueda, Luis G., and B. John Oommen. "A nearly-optimal Fano-based coding algorithm." Information Processing & Management 40, no. 2 (2004): 257–68. http://dx.doi.org/10.1016/s0306-4573(03)00007-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Shokurov, A. V. "Image coding with optimal decoding possible afterwards." Journal of Mathematical Sciences 156, no. 2 (2009): 359–80. http://dx.doi.org/10.1007/s10958-008-9273-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Zadiraka, V. K., and V. N. Evtushenko. "Optimal zone coding using the slant transform." Cybernetics and Systems Analysis 30, no. 4 (1994): 518–22. http://dx.doi.org/10.1007/bf02366561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Lee, Dujeong, Kyounghye Kim, and June-Koo Kevin Rhee. "Optimal Multicast Control for Simple Network Coding." IEEE Transactions on Vehicular Technology 64, no. 6 (2015): 2375–86. http://dx.doi.org/10.1109/tvt.2014.2342261.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Anmin Liu, W. S. Lin, M. Paul, Fan Zhang, and Chenwei Deng. "Optimal Compression Plane for Efficient Video Coding." IEEE Transactions on Image Processing 20, no. 10 (2011): 2788–99. http://dx.doi.org/10.1109/tip.2011.2134858.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Atta, R. "Optimal bit allocation for subband video coding." IET Image Processing 4, no. 5 (2010): 365. http://dx.doi.org/10.1049/iet-ipr.2009.0172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Cui, Yi, Yuan Xue, and Klara Nahrstedt. "Optimal distributed multicast routing using network coding." ACM SIGMETRICS Performance Evaluation Review 32, no. 2 (2004): 47–49. http://dx.doi.org/10.1145/1035334.1035353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Bouvet, Pierre-Jean, and Maryline Hélard. "Optimal space-time coding under iterative processing." annals of telecommunications - annales des télécommunications 69, no. 3-4 (2013): 229–38. http://dx.doi.org/10.1007/s12243-013-0353-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Samčović, Andreja. "Analysis of Coding Gain and Optimal Bit Allocation in Motion-Compensated Video Compression." Journal of Electrical Engineering 63, no. 2 (2012): 129–32. http://dx.doi.org/10.2478/v10187-012-0020-z.

Full text

Abstract:

Analysis of Coding Gain and Optimal Bit Allocation in Motion-Compensated Video CompressionThis paper describes mathematical frameworks on temporal and spatial predictive processing in the motion-compensated video compression. Firstly, the coding gain over intra coding is derived, regarding the bit allocation algorithm and Lagrange multiplier method. The optimal ordering of three different picture types (I, P and B pictures) is clarified according to image source characteristics. Secondly, a novel framework with the block-based multihypothesis motion-compensated optimal coding gain and bit allo

APA, Harvard, Vancouver, ISO, and other styles

42

Chen, Sovann, Supavadee Aramvith, and Yoshikazu Miyanaga. "Learning-Based Rate Control for High Efficiency Video Coding." Sensors 23, no. 7 (2023): 3607. http://dx.doi.org/10.3390/s23073607.

Full text

Abstract:

High efficiency video coding (HEVC) has dramatically enhanced coding efficiency compared to the previous video coding standard, H.264/AVC. However, the existing rate control updates its parameters according to a fixed initialization, which can cause errors in the prediction of bit allocation to each coding tree unit (CTU) in frames. This paper proposes a learning-based mapping method between rate control parameters and video contents to achieve an accurate target bit rate and good video quality. The proposed framework contains two main structural codings, including spatial and temporal coding.

APA, Harvard, Vancouver, ISO, and other styles

43

Yang, Xiao Bo, and Bang Ze Chen. "Huffman Tree Visualization." Advanced Materials Research 468-471 (February 2012): 1883–86. http://dx.doi.org/10.4028/www.scientific.net/amr.468-471.1883.

Full text

Abstract:

Huffman tree is also called the optimal binary tree, is a kind of weighted shortest path length of the binary tree; Huffman coding is a coding method, which is used for a lossless data compression entropy coding ( right encoding ) optimal coding method. The realization of Huffman tree visualization is of great significance, this paper uses the object-oriented method, using a complete binary tree of Huffman tree visualization, visual image display of the Huffman coding process.

APA, Harvard, Vancouver, ISO, and other styles

44

Strintzis, M. G., and D. Tzovaras. "Optimal pyramidal decomposition for progressive multidimensional signal coding using optimal quantizers." IEEE Transactions on Signal Processing 46, no. 4 (1998): 1054–68. http://dx.doi.org/10.1109/78.668556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

WANG, XING-YUAN, FAN-PING LI, and ZHI-FENG CHEN. "AN IMPROVED FRACTAL IMAGE CODING METHOD." Fractals 17, no. 04 (2009): 451–57. http://dx.doi.org/10.1142/s0218348x09004545.

Full text

Abstract:

This paper presents a fast fractal image coding method based on quadtree division, improved neighbor search and asymptotic strategy. We search the optimal matched domain block of a range block in its five nearest neighbor blocks and make asymptotic moves along the direction of potential optimal solution. If the optimal solution can not be improved, we carry out quadtree division for this range block until it caters to our demand or reaches greatest division level. The experimental results show that the coding speed of the proposed method declined slightly, but it has a better quality of recons

APA, Harvard, Vancouver, ISO, and other styles

46

Huang, Hai Lin, and Zhao Yu Sun. "Thermal Entanglement and Dense Coding in Two-Qubit XX Spin Chain under an Arbitrary Magnetic Field." Applied Mechanics and Materials 446-447 (November 2013): 986–91. http://dx.doi.org/10.4028/www.scientific.net/amm.446-447.986.

Full text

Abstract:

The effect of arbitrary orientation in the magnetic field on the entanglement and dense coding of a two-qubit XX model is investigated. The concurrence and optimal dense coding capacity are calculated for different orientations of the magnetic field. It is found that the entanglement can be maximized by rotating the magnetic field to an optimal direction at given temperature. Furthermore, there exists critical concurrence Cc, beyond which the thermal state is unfeasible for optimal dense coding.

APA, Harvard, Vancouver, ISO, and other styles

47

Libao Zhang, Libao Zhang, and Kaina Yang Kaina Yang. "Image coding based on integer wavelet and embedded optimal coef f icient scaling." Chinese Optics Letters 10, s1 (2012): S11010–311013. http://dx.doi.org/10.3788/col201210.s11010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

ANDROSHCHUK, O., O. NAHREBETSKYY, V. ORLENKO, V. CHESHUN, and A. KATAIEVA. "BASIC OPERATIONS OF SHIFT CODE FORMATION ALGORITHM USING HUFFMAN ENTROPY CODING." Herald of Khmelnytskyi National University. Technical sciences 291, no. 6 (2020): 7–12. https://doi.org/10.31891/2307-5732-2020-291-6-7-12.

Full text

Abstract:

The complexity and relevance of the tasks of cryptographic protection of information in the context of the increased value of information resources in the cyberspace causes interest in improving existing encryption algorithms and developing new ones. The paper presents the results of a study of the characteristic features of the method for increasing the cryptographic strength of encryption algorithms by modifying the input data using the methods of optimal entropy uneven coding using the example of Caesar replacement ciphers and optimal Huffman coding. Based on the results of the analysis, a

APA, Harvard, Vancouver, ISO, and other styles

49

ŠUPOL, JAN, and BOŘIVOJ MELICHAR. "ARITHMETIC CODING IN PARALLEL." International Journal of Foundations of Computer Science 16, no. 06 (2005): 1207–17. http://dx.doi.org/10.1142/s0129054105003765.

Full text

Abstract:

We present an EREW PRAM cost optimal parallel algorithm for arithmetic coding computation. We solve the problem in [Formula: see text] time using n/log n processors. Each part of the algorithm as well as a well-known parallel prefix computation forming a basis of the algorithm are clarified on simple examples.

APA, Harvard, Vancouver, ISO, and other styles

50

Caire, Giuseppe, Petros Elia, and K. Raj Kumar. "Space-Time Coding: an Overview." Journal of Communications Software and Systems 2, no. 3 (2017): 212. http://dx.doi.org/10.24138/jcomss.v2i3.284.

Full text

Abstract:

This work provides an overview of the fundamental aspects and of some recent advances in space-time coding (STC). Basic information theoretic results on Multiple-Input Multiple-Output (MIMO) fading channels, pertaining to capacity, diversity, and to the optimal Diversity Multiplexing Tradeoff (DMT), are reviewed. The code design for the quasi-static, outage limited, fading channel is recognized as the most challenging and innovative with respect to traditional “Gaussian” coding. Then, a survey of STC constructions is presented. This culminates with the description of families of codes that are

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!