Relevant bibliographies by topics / Coding, information theory and compression / Dissertations / Theses

Dissertations / Theses on the topic 'Coding, information theory and compression'

To see the other types of publications on this topic, follow the link: Coding, information theory and compression.
Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Coding, information theory and compression.'

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 dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Zemouri, Rachid. "Data compression of speech using sub-band coding." Thesis, University of Newcastle Upon Tyne, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Reid, Mark Montgomery. "Path-dictated, lossless volumetric data compression." Thesis, University of Ulster, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shih, An-Zen. "Fractal compression analysis of superdeformed nucleus data." Thesis, University of Liverpool, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266091.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tang, P. S. "Data compression for high precision digital waveform recording." Thesis, City University London, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yamazato, Takaya, Iwao Sasase, and Shinsaku Mori. "Interlace Coding System Involving Data Compression Code, Data Encryption Code and Error Correcting Code." IEICE, 1992. http://hdl.handle.net/2237/7844.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jiang, Jianmin. "Multi-media data compression and real-time novel architectures implementation." Thesis, University of Southampton, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239417.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Reeder, Brian Martin. "Application of artificial neural networks for spacecraft instrument data compression." Thesis, University of Sussex, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362216.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Beirami, Ahmad. "Network compression via network memory: fundamental performance limits." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53448.

Full text
Abstract:
The amount of information that is churned out daily around the world is staggering, and hence, future technological advancements are contingent upon development of scalable acquisition, inference, and communication mechanisms for this massive data. This Ph.D. dissertation draws upon mathematical tools from information theory and statistics to understand the fundamental performance limits of universal compression of this massive data at the packet level using universal compression just above layer 3 of the network when the intermediate network nodes are enabled with the capability of memorizing the previous traffic. Universality of compression imposes an inevitable redundancy (overhead) to the compression performance of universal codes, which is due to the learning of the unknown source statistics. In this work, the previous asymptotic results about the redundancy of universal compression are generalized to consider the performance of universal compression at the finite-length regime (that is applicable to small network packets). Further, network compression via memory is proposed as a compression-based solution for the compression of relatively small network packets whenever the network nodes (i.e., the encoder and the decoder) are equipped with memory and have access to massive amounts of previous communication. In a nutshell, network compression via memory learns the patterns and statistics of the payloads of the packets and uses it for compression and reduction of the traffic. Network compression via memory, with the cost of increasing the computational overhead in the network nodes, significantly reduces the transmission cost in the network. This leads to huge performance improvement as the cost of transmitting one bit is by far greater than the cost of processing it.
APA, Harvard, Vancouver, ISO, and other styles
9

Floor, Pål Anders. "On the Theory of Shannon-Kotel'nikov Mappings in Joint Source-Channel Coding." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-2193.

Full text
Abstract:

In this thesis an approach to joint source-channel coding using direct source to channel mappings is studied. The system studied communicates i.i.d. Gaussian sources on a point-to-point Gaussian memoryless channel with limited feedback (supporting channel state information at most). The mappings, named Shannon-Kotel'nikov (SK) mappings, are memoryless mappings between the source space of dimension M and the channel space of dimension N. Such mappings can be used for error control when MN, called dimension reduction. The SK-mappings operate on amplitude continuous and time discrete signals (meaning that there is no bits involved) through (piecewise) continuous curves or hyper surfaces in general.

The reason for studying SK-mappings is that they are delay free, robust against varying channel conditions, and have quite good performance at low complexity.

First a theory for determining and categorizing the distortion using SK-mappings for communication is introduced and developed. This theory is further used to show that SK-mappings can reach the information theoretical bound optimal performance theoretically attainable (OPTA) when their dimension approach infinity.

One problem is to determine the overall optimal geometry of the SK-mappings. Indications on the overall geometry can be found by studying the codebooks and channel constellations of power constrained channel optimized vector quantizers (PCCOVQ). The PCCOVQ algorithm will find the optimal placing of quantizer representation vectors in the source space and channel symbols in the channel space. A PCCOVQ algorithm giving well performing mappings for the dimension reduction case has been found in the past. In this thesis the PCCOVQ algorithm is modified to give well performing dimension expanding mappings for scalar sources, and 1:2 and 1:3 PCCOVQ examples are given.

Some example SK-mappings are proposed and analyzed. 2:1 and 1:2 PCCOVQ mappings are used as inspiration for making 2:1 and 1:2 SK-mappings based on the Archimedean spiral. Further 3:1, 4:1, 3:2 and 2:3 SK-mappings are found and analyzed. All example SK-mappings are modeled mathematically using the proposed theory on SK-mappings. These mathematical models are further used to find the optimal coefficients for all the proposed SK-mappings as a function of the channel signal-to-noise ratio (CSNR), making adaptations to varying channel conditions simple.

APA, Harvard, Vancouver, ISO, and other styles
10

Zhao, Jing. "Information theoretic approach for low-complexity adaptive motion estimation." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0013068.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Su, Yong. "Mathematical modeling with applications in high-performance coding." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1127139848.

Full text
Abstract:
Thesis (Ph. D.)--Ohio State University, 2005.
Title from first page of PDF file. Document formatted into pages; contains xiv, 130 p.; also includes graphics (some col.). Includes bibliographical references (p. 125-130). Available online via OhioLINK's ETD Center
APA, Harvard, Vancouver, ISO, and other styles
12

Zhang, Jian Electrical Engineering Australian Defence Force Academy UNSW. "Error resilience for video coding services over packet-based networks." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Electrical Engineering, 1999. http://handle.unsw.edu.au/1959.4/38652.

Full text
Abstract:
Error resilience is an important issue when coded video data is transmitted over wired and wireless networks. Errors can be introduced by network congestion, mis-routing and channel noise. These transmission errors can result in bit errors being introduced into the transmitted data or packets of data being completely lost. Consequently, the quality of the decoded video is degraded significantly. This thesis describes new techniques for minimising this degradation. To verify video error resilience tools, it is first necessary to consider the methods used to carry out experimental measurements. For most audio-visual services, streams of both audio and video data need to be simultaneously transmitted on a single channel. The inclusion of the impact of multiplexing schemes, such as MPEG 2 Systems, in error resilience studies is also an important consideration. It is shown that error resilience measurements including the effect of the Systems Layer differ significantly from those based only on the Video Layer. Two major issues of error resilience are investigated within this thesis. They are resynchronisation after error detection and error concealment. Results for resynchronisation using small slices, adaptive slice sizes and macroblock resynchronisation schemes are provided. These measurements show that the macroblock resynchronisation scheme achieves the best performance although it is not included in MPEG2 standard. The performance of the adaptive slice size scheme, however, is similar to that of the macroblock resynchronisation scheme. This approach is compatible with the MPEG 2 standard. The most important contribution of this thesis is a new concealment technique, namely, Decoder Motion Vector Estimation (DMVE). The decoded video quality can be improved significantly with this technique. Basically, this technique utilises the temporal redundancy between the current and the previous frames, and the correlation between lost macroblocks and their surrounding pixels. Therefore, motion estimation can be applied again to search in the previous picture for a match to those lost macroblocks. The process is similar to that the encoder performs, but it is in the decoder. The integration of techniques such as DMVE with small slices, or adaptive slice sizes or macroblock resynchronisation is also evaluated. This provides an overview of the performance produced by individual techniques compared to the combined techniques. Results show that high performance can be achieved by integrating DMVE with an effective resynchronisation scheme, even at a high cell loss rates. The results of this thesis demonstrate clearly that the MPEG 2 standard is capable of providing a high level of error resilience, even in the presence of high loss. The key to this performance is appropriate tuning of encoders and effective concealment in decoders.
APA, Harvard, Vancouver, ISO, and other styles
13

Cai, Jianfei. "Robust error control and optimal bit allocation for image and video transmission over wireless channels /." free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3052158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Dupraz, Elsa. "Codage de sources avec information adjacente et connaissance incertaine des corrélations." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00955100.

Full text
Abstract:
Dans cette thèse, nous nous sommes intéressés au problème de codage de sources avec information adjacente au décodeur seulement. Plus précisément, nous avons considéré le cas où la distribution jointe entre la source et l'information adjacente n'est pas bien connue. Dans ce contexte, pour un problème de codage sans pertes, nous avons d'abord effectué une analyse de performance à l'aide d'outils de la théorie de l'information. Nous avons ensuite proposé un schéma de codage pratique efficace malgré le manque de connaissance sur la distribution de probabilité jointe. Ce schéma de codage s'appuie sur des codes LDPC non-binaires et sur un algorithme de type Espérance-Maximisation. Le problème du schéma de codage proposé, c'est que les codes LDPC non-binaires utilisés doivent être performants. C'est à dire qu'ils doivent être construits à partir de distributions de degrés qui permettent d'atteindre un débit proche des performances théoriques. Nous avons donc proposé une méthode d'optimisation des distributions de degrés des codes LDPC. Enfin, nous nous sommes intéressés à un cas de codage avec pertes. Nous avons supposé que le modèle de corrélation entre la source et l'information adjacente était décrit par un modèle de Markov caché à émissions Gaussiennes. Pour ce modèle, nous avons également effectué une analyse de performance, puis nous avons proposé un schéma de codage pratique. Ce schéma de codage s'appuie sur des codes LDPC non-binaires et sur une reconstruction MMSE. Ces deux composantes exploitent la structure avec mémoire du modèle de Markov caché.
APA, Harvard, Vancouver, ISO, and other styles
15

Coben, Muhammed Z. "Region-based subband coding of image sequences." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15500.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Reusens, Emmanuel. "Visual data compression using the fractal theory and dynamic coding /." Lausanne : Ecole polytechnique fédérale, 1997. http://library.epfl.ch/theses/?nr=1590.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Cesbron, Fred́eŕique Chantal. "Multiresolution fractal coding of still images." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15508.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Ng, Cheuk-yan, and 吳卓恩. "Rate control algorithms for video coding." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B29729361.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Ng, Cheuk-yan. "Rate control algorithms for video coding /." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25151289.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Bartelmess, Johan. "Compression efficiency of different picture coding structures in High Efficiency Video Coding (HEVC)." Thesis, Uppsala universitet, Avdelningen för systemteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-281926.

Full text
Abstract:
Video content is expected to account for 80 percent of all Internet traffic in 2019. There is therefore an increasing need for better video compression methods, to decrease the use of internet bandwidth. One way of achieving high video compression is to predict pixel values for a video frame based on prior and succeeding pictures in the video. The H.265 video compression standard supports this method, and in particular makes it possible to specify in which order pictures are coded, and which pictures are predicted from which. The coding order is specified for Groups Of Pictures (GOP), where a number of pictures are grouped together and predicted from each other in a specified order. This thesis evaluates how the GOPs should be structured, for instance in terms of sizing, to maximize the compression efficiency relative to the video quality. It also investigates the effect of multiple reference pictures, a functionality that enables the picture that renders the best prediction to be selected. The results show that the largest tested GOP size of 32 pictures is preferable for all tested video characteristics, and that support for multiple reference pictures renders a similar increase in compression efficiency for all GOP sizes.
APA, Harvard, Vancouver, ISO, and other styles
21

Kunze, Richard J. "Redundant visual coding of state information /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Miguel, Agnieszka C. "Image compression using overcomplete wavelet representations for multiple description coding /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/5920.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Cohen, D. A. "A problem in algebraic coding theory." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Armitano, Robert M. "Efficient motion-estimation algorithms for video coding." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/15397.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Redwood-Sawyerr, J. A. S. "Constant envelope modulation coding." Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Yun, Hee Cheol. "Compression of computer animation frames." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/13070.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Chan, Ming-Yan. "Video encoder complexity reduction /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20CHANM.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Chau, Wing San. "Key frame selection for video transcoding /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20CHAU.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Sipitca, Mihai. "A conditional entropy approach to encoding DCT coefficients for low bit rate video compression." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/13404.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Delopoulos, Athanasios. "Coding techniques for moving images." Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338648.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Kaouri, Hussein Ali. "Speech coding using vector quantisation." Thesis, Queen's University Belfast, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356934.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Bae, Soo Hyun. "Information retrieval via universal source coding." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26573.

Full text
Abstract:
Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009.
Committee Chair: Juang, Biing-Hwang; Committee Member: Al-Regib, Ghassan; Committee Member: Linda Wiils; Committee Member: Mersereau, Russell; Committee Member: Pappas, Thrasyvoulos. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
33

Danyali, Habibollah. "Highly scalable wavelet image and video coding for transmission over heterogeneous networks." Access electronically, 2004. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20041027.115306/index.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Tay, David B. H. "Multidimensional multirate filter banks : some theory and design." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

蔡固庭 and Koo-ting Choi. "Improved processing techniques for picture sequence coding." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31220642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Choi, Koo-ting. "Improved processing techniques for picture sequence coding /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20565550.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Allott, David. "Efficient source coding for digital images." Thesis, Loughborough University, 1985. https://dspace.lboro.ac.uk/2134/27563.

Full text
Abstract:
A requirement exists for interactive view-data systems to incorporate some facility for the transmission of good quality multi-level single-frame images (both monochrome and colour) for both general information services and more commercial applications such as mail order catalogues.
APA, Harvard, Vancouver, ISO, and other styles
38

Presnell, Stuart. "Minimal resources in quantum information theory : compression and measurement." Thesis, University of Bristol, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399944.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

McEwen, Peter A. "Trellis coding for partial response channels /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9968170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Cheng, Niann-Tsyr. "Error resilient video coding for noisy channels." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Lund, David J. "Reconfigurable channel coding for future communication systems." Thesis, Lancaster University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Suddle, Muhammad Riaz. "Speech coding in private and broadcast networks." Thesis, University of Surrey, 1996. http://epubs.surrey.ac.uk/1019/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Goh, Kwong Huang. "Wavelet transform based image and video coding." Thesis, University of Strathclyde, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387720.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Sadok, Djamel Fawzi Hadj. "Interpersonal interchange of multimedia information." Thesis, University of Kent, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Hong, Edwin S. "Group testing for image compression /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6900.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Luo, Enming. "Computational complexity reduction in the spatial scalable video coding encoder /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20LUOE.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Shu, Yan. "Coding of motion picture residues without adaptive spatial transforms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0030/MQ47477.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Panchapakesan, Kannan. "A study of Trellis coded quantization for image compression /." Online version of thesis, 1996. http://hdl.handle.net/1850/11700.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Sun, Wei. "Joint Compression and Digital Watermarking: Information-Theoretic Study and Algorithms Development." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2890.

Full text
Abstract:
In digital watermarking, a watermark is embedded into a covertext in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. The watermarked signal can then be used for different purposes ranging from copyright protection, data authentication,fingerprinting, to information hiding. In this thesis, digital watermarking will be investigated from both an information theoretic viewpoint and a numerical computation viewpoint.

From the information theoretic viewpoint, we first study a new digital watermarking scenario, in which watermarks and covertexts are generated from a joint memoryless watermark and covertext source. The configuration of this scenario is different from that treated in existing digital watermarking works, where watermarks are assumed independent of covertexts. In the case of public watermarking where the covertext is not accessible to the watermark decoder, a necessary and sufficient condition is determined under which the watermark can be fully recovered with high probability at the end of watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel. Moreover, by using similar techniques, a combined source coding and Gel'fand-Pinsker channel coding theorem is established, and an open problem proposed recently by Cox et al is solved. Interestingly, from the sufficient and necessary condition we can show that, in light of the correlation between the watermark and covertext, watermarks still can be fully recovered with high probability even if the entropy of the watermark source is strictly above the standard public watermarking capacity.

We then extend the above watermarking scenario to a case of joint compression and watermarking, where the watermark and covertext are correlated, and the watermarked signal has to be further compressed. Given an additional constraint of the compression rate of the watermarked signals, a necessary and sufficient condition is determined again under which the watermark can be fully recovered with high probability at the end of public watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel.

The above two joint compression and watermarking models are further investigated under a less stringent environment where the reproduced watermark at the end of decoding is allowed to be within certain distortion of the original watermark. Sufficient conditions are determined in both cases, under which the original watermark can be reproduced with distortion less than a given distortion level after the watermarked signal is disturbed by a fixed memoryless attack channel and the covertext is not available to the watermark decoder.

Watermarking capacities and joint compression and watermarking rate regions are often characterized and/or presented as optimization problems in information theoretic research. However, it does not mean that they can be calculated easily. In this thesis we first derive closed forms of watermarking capacities of private Laplacian watermarking systems with the magnitude-error distortion measure under a fixed additive Laplacian attack and a fixed arbitrary additive attack, respectively. Then, based on the idea of the Blahut-Arimoto algorithm for computing channel capacities and rate distortion functions, two iterative algorithms are proposed for calculating private watermarking capacities and compression and watermarking rate regions of joint compression and private watermarking systems with finite alphabets. Finally, iterative algorithms are developed for calculating public watermarking capacities and compression and watermarking rate regions of joint compression and public watermarking systems with finite alphabets based on the Blahut-Arimoto algorithm and the Shannon's strategy.
APA, Harvard, Vancouver, ISO, and other styles
50

Ahmed, Mohammed Zaki. "Crosstalk-resiliant coding for high density digital recording." Thesis, University of Plymouth, 2003. http://hdl.handle.net/10026.1/2536.

Full text
Abstract:
Increasing the track density in magnetic systems is very difficult due to inter-track interference (ITI) caused by the magnetic field of adjacent tracks. This work presents a two-track partial response class 4 magnetic channel with linear and symmetrical ITI; and explores modulation codes, signal processing methods and error correction codes in order to mitigate the effects of ITI. Recording codes were investigated, and a new class of two-dimensional run-length limited recording codes is described. The new class of codes controls the type of ITI and has been found to be about 10% more resilient to ITI compared to conventional run-length limited codes. A new adaptive trellis has also been described that adaptively solves for the effect of ITI. This has been found to give gains up to 5dB in signal to noise ratio (SNR) at 40% ITI. It was also found that the new class of codes were about 10% more resilient to ITI compared to conventional recording codes when decoded with the new trellis. Error correction coding methods were applied, and the use of Low Density Parity Check (LDPC) codes was investigated. It was found that at high SNR, conventional codes could perform as well as the new modulation codes in a combined modulation and error correction coding scheme. Results suggest that high rate LDPC codes can mitigate the effect of ITI, however the decoders have convergence problems beyond 30% ITI.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Coding, information theory and compression' for other source types:
Journal articles Books
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!

To the bibliography