Universal codeword sets and representations of the integers

Eliáš, P.

doi:10.1109/tit.1975.1055349

Cited by 998 publications

(657 citation statements)

References 9 publications

Supporting

Mentioning

646

Contrasting

Unclassified

Order By: Relevance

“…a QRS complex) as the reference. Then the real form of the measuring-computing process will better correspond to the Elias iterated codes, which use a number of checking systems (including table ones in accordance with the reference template or a database in modern versions) [35]. The shift registers can be also applied here as with the more simple cases (the only problem arose when detecting U-component after T-component in the model data).…”

Section: Methodological and Terminological Issuesmentioning

confidence: 99%

Correction of the recording artifacts and detection of the functional deviations in ECG by means of syndrome decoding with an automatic burst error correction of the cyclic codes using periodograms for determination of code component spectral range

Adamoviс¹,

Aleksandrov²,

Градов³

et al. 2016

Cardiometry

View full text Add to dashboard Cite

AimsThis paper describes a novel approach to the analysis of electrocardiographic data based on the consideration of the repetitive P, Q, R, S, T sequences as cyclic codes. In Part I we introduce a principle similar to the syndrome decoding using the control numbers, which allows correcting the noise combinations. Materials and methodsWe propose to apply the burst-error-correcting algorithms for automatic detection of the ECG artifacts and the functional abnormalities, including those compared to the reference model. Our approach is compared to the symbolic dynamics methods in cardiology practice. During the automated search of the code components (i.e. point values and spectral ranges one-to-one corresponding to P, Q, R, S, T) considered in Part II, the authors apply the Lomb-Scargle periodogram method with the phase control which allows to determine the code components not only from the main harmonics, but also using the sidebands, avoiding the phase errors. ResultsThe results of the method testing on rats with the heart failure using a simplified telemetric recording from the implantable chips are given in Part III. A complete independence of the results of the determination of the code points (fingerprints) from the variables for which the calculation is performed is shown. We also prove the robustness of the above approach with respect to the most types of the non-adaptive filtration. ConclusionThe above method can be useful not only for experimental medicine, but also for veterinary and clinical diagnostic practice. This method is adequately reproducable both on animals and human ECG, except for some constant values.

show abstract

Section: Methodological and Terminological Issuesmentioning

confidence: 99%

Correction of the recording artifacts and detection of the functional deviations in ECG by means of syndrome decoding with an automatic burst error correction of the cyclic codes using periodograms for determination of code component spectral range

Adamoviс¹,

Aleksandrov²,

Градов³

et al. 2016

Cardiometry

View full text Add to dashboard Cite

show abstract

“…While this can lead to extremely large representations, it is still advantageous to code small values. Gamma, described in [6], represents x as the Unary representation of 1+ log 2 x followed by the binary representation of x − 2 log 2 x (ex. : 9 is 1110 001).…”

Section: Oblivious Codecsmentioning

confidence: 99%

“…Indeed, as ranking is data-intensive due to the traversing of posting lists, maximising decompression speed while minimising the size of the posting lists is necessary to ensure quick query response times. As docid ordered posting lists contain integer numbers, such compression schemes (or codecs) can be operated on a stream of postings -known as oblivious -(for example, Elias-Gamma [6]), or on groups of postings -known as list-adaptive [7] -(e.g. PForDelta [8]).…”

Section: Introductionmentioning

confidence: 99%

On Inverted Index Compression for Search Engine Efficiency

Catena

Macdonald

Ounis

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Efficient access to the inverted index data structure is a key aspect for a search engine to achieve fast response times to users' queries. While the performance of an information retrieval (IR) system can be enhanced through the compression of its posting lists, there is little recent work in the literature that thoroughly compares and analyses the performance of modern integer compression schemes across different types of posting information (document ids, frequencies, positions). In this paper, we experiment with different modern integer compression algorithms, integrating these into a modern IR system. Through comprehensive experiments conducted on two large, widely used document corpora and large query sets, our results show the benefit of compression for different types of posting information to the space-and time-efficiency of the search engine. Overall, we find that the simple Frame of Reference compression scheme results in the best query response times for all types of posting information. Moreover, we observe that the frequency and position posting information in Web corpora that have large volumes of anchor text are more challenging to compress, yet compression is beneficial in reducing average query response times.

show abstract

“…Then, we encode each integer in the list using the δ code of Elias [6]. The codeword length for integer t is upperbounded by f (t) = log t + 2 log(log t + 1) + 1 bit,…”

Section: Second-step Algorithmmentioning

confidence: 99%

Novel and Generalized Sort-Based Transform for Lossless Data Compression

Inagaki

Tomizawa

Yokoo

2009

String Processing and Information Retrieval

View full text Add to dashboard Cite

Abstract. We propose a new sort-based transform for lossless data compression that can replace the BWT transform in the block-sorting data compression algorithm. The proposed transform is a parametric generalization of the BWT and the RadixZip transform proposed by Vo and Manku (VLDB, 2008), which is a rather new variation of the BWT. For a class of parameters, the transform can be performed in time linear in the data length. We give an asymptotic compression bound attained by our algorithm.

show abstract

Universal codeword sets and representations of the integers

Cited by 998 publications

References 9 publications

Correction of the recording artifacts and detection of the functional deviations in ECG by means of syndrome decoding with an automatic burst error correction of the cyclic codes using periodograms for determination of code component spectral range

Correction of the recording artifacts and detection of the functional deviations in ECG by means of syndrome decoding with an automatic burst error correction of the cyclic codes using periodograms for determination of code component spectral range

On Inverted Index Compression for Search Engine Efficiency

Novel and Generalized Sort-Based Transform for Lossless Data Compression

Contact Info

Product

Resources

About