Results 201 to 210 of about 249,251 (264)
OpenPMX Software for Nonlinear Mixed-Effect Models in Pharmacometrics: Precision Compared With NONMEM First-Order Conditional Estimation. [PDF]
CPT Pharmacometrics Syst PharmacolEleveld DJ +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Information Processing Letters, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gilad Baruch +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gilad Baruch +2 more
openaire +1 more source
IEEE Transactions on Communications, 1996
The A* algorithm is applied to maximum-likelihood soft-decision decoding of binary linear block codes. This paper gives a tutorial on the A* algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained for several codes.
Laura Ekroot, Sam Dolinar
openaire +1 more source
The A* algorithm is applied to maximum-likelihood soft-decision decoding of binary linear block codes. This paper gives a tutorial on the A* algorithm, compares the decoding complexity with that of exhaustive search and Viterbi decoding algorithms, and presents performance curves obtained for several codes.
Laura Ekroot, Sam Dolinar
openaire +1 more source
IEEE Information Theory Workshop, 2005., 2005
A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes.
Vladimir Sidorenko +4 more
openaire +1 more source
A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes.
Vladimir Sidorenko +4 more
openaire +1 more source
IEEE Transactions on Information Theory, 2009
A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander ...
Alberto Jiménez Feltström +3 more
openaire +1 more source
A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander ...
Alberto Jiménez Feltström +3 more
openaire +1 more source
Block and sliding-block source coding
IEEE Transactions on Information Theory, 1977A new form of source coding subject to a fidelity criterion, called sliding-block coding, has recently been introduced by Gray, Neuhoff, and Ornstein. A method of conversion from block coding to sliding-block coding, or vice versa, with an arbitrarily small increase in rate is shown for ergodic sources.
Paul C. Shields, David L. Neuhoff
openaire +2 more sources
Block truncation coding with entropy coding
IEEE Transactions on Communications, 1995Block truncation coding (BTC) is a simple and fast image compression algorithm which achieves a constant bit rate of 2.0 bits per pixel. The method is however suboptimal. We propose a modification of BTC in which the compression ratio is improved by coding the quantization data and the bit plane by arithmetic coding with an adaptive modelling scheme ...
Pasi Fränti, Olli Nevalainen
openaire +1 more source
Extension of source coding theorems for block codes to sliding-block codes
IEEE Transactions on Information Theory, 1980For arbitrary alphabets and single-letter fidelity criteria, two theorems are given which allow any fixed-rate or variable-rate source coding theorem for block codes to be extended to sliding-block codes. Applications are given to universal coding and to the coding of a stationary nonergodic source.
openaire +1 more source
Synchronization methods for block codes
IEEE Transactions on Information Theory, 1962Summary: Efficient use of block codes to communicate over a telemetry channel is dependent upon the knowledge of the instants, in time, that one code waveform, or code word, ends and the succeeding waveform begins. This word synchronization is the subject of concern in this paper.
openaire +1 more source
Improved Code Shortening for Block and Product Codes
2006 IEEE 63rd Vehicular Technology Conference, 2006Code shortening is commonly performed in practice but its analytical decoding performance is not well understood. In this letter, we present tight bounds for estimating the weight enumerator and hence BER (bit error rate) performance of linear shortened and shortened-extended block/product codes operating in AWGN and Rayleigh fading channels.
Kai Ching Lim, Yong Liang Guan 0001
openaire +1 more source