Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,439
Block length selection in the bootstrap for time series
- Comput. Statist. Data Anal
, 1999
"... The blockwise bootstrap is a modification of Efron's bootstrap designed to give correct results for dependent stationary observations. One drawback of the method is that it depends critically on a block length which had to be chosen by the user. Here we propose a fully data-driven method to sel ..."
Abstract
-
Cited by 31 (3 self)
- Add to MetaCart
The blockwise bootstrap is a modification of Efron's bootstrap designed to give correct results for dependent stationary observations. One drawback of the method is that it depends critically on a block length which had to be chosen by the user. Here we propose a fully data-driven method
A Study on Universal Codes With Finite Block Lengths
"... Abstract—Based on random codes and typical set decoding, an alternative proof of Root and Varaiya’s compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds and simulati ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract—Based on random codes and typical set decoding, an alternative proof of Root and Varaiya’s compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds
Diversity versus channel knowledge at finite block-length
- in Proc. IEEE Inf. Theory Workshop (ITW
, 2012
"... Abstract-We study the maximal achievable rate R * (n, ) for a given block-length n and block error probability over Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that for a given blocklength and error probability, R * (n, ) is not ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
Abstract-We study the maximal achievable rate R * (n, ) for a given block-length n and block error probability over Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that for a given blocklength and error probability, R * (n
CORRECTION TO “AUTOMATIC BLOCK-LENGTH SELECTION FOR
"... A correction on the optimal block size algorithms of Politis and White (2004) is given following a correction of Lahiri’s (1999) theoretical results by Nordman (2008). ..."
Abstract
- Add to MetaCart
A correction on the optimal block size algorithms of Politis and White (2004) is given following a correction of Lahiri’s (1999) theoretical results by Nordman (2008).
Improved Short Block-Length Turbo Decoding
, 2003
"... Iterative decoding performance for rate 1/3, message block length 256 and 128 parallel concatenated codes is improved by utilizing second order extrinsic information. This second order extrinsic information has the property that the information for each bit in the block is independent of the corresp ..."
Abstract
- Add to MetaCart
Iterative decoding performance for rate 1/3, message block length 256 and 128 parallel concatenated codes is improved by utilizing second order extrinsic information. This second order extrinsic information has the property that the information for each bit in the block is independent
Automatic Block-Length Selection for the Dependent Bootstrap
- Econometric Reviews
, 2004
"... We review the different block bootstrap methods for time series, and present them in a unified framework. We then revisit a recent result of Lahiri [Lahiri, S. N. (1999b). Theoretical comparisons of block bootstrap methods, Ann. Statist. ..."
Abstract
-
Cited by 77 (6 self)
- Add to MetaCart
We review the different block bootstrap methods for time series, and present them in a unified framework. We then revisit a recent result of Lahiri [Lahiri, S. N. (1999b). Theoretical comparisons of block bootstrap methods, Ann. Statist.
Finite Block-Length Gains in Distributed Source Coding
"... Abstract—A new coding scheme for the distributed source coding problem for general discrete memoryless sources is presented. The scheme involves a two-layered coding strategy, the first layer code is of constant finite block-length whereas the second layer contains codes of block-length approaching ..."
Abstract
- Add to MetaCart
Abstract—A new coding scheme for the distributed source coding problem for general discrete memoryless sources is presented. The scheme involves a two-layered coding strategy, the first layer code is of constant finite block-length whereas the second layer contains codes of block-length approaching
Evaluation of Gallager Codes for Short Block Length and High Rate Applications
- IN CODES, SYSTEMS AND GRAPHICAL MODELS
, 1999
"... Gallager codes with large block length and low rate (e.g., N ' 10; 000-40; 000, R ' 0:25-0:5) have been shown to have record{breaking performance for low signal{ to{noise applications. In this paper we study Gallager codes at the other end of the spectrum. We first explore the theoretical ..."
Abstract
-
Cited by 78 (9 self)
- Add to MetaCart
Gallager codes with large block length and low rate (e.g., N ' 10; 000-40; 000, R ' 0:25-0:5) have been shown to have record{breaking performance for low signal{ to{noise applications. In this paper we study Gallager codes at the other end of the spectrum. We first explore
Cryptanalysis of Double-Block-Length Hash Mode MJH
"... A double-block-length (DBL) hash mode of block ciphers, MJH has been proved to be collision-resistant in the ideal cipher model upto 2 2n/3−log n queries. In this paper we provide first cryptanalytic results for MJH. We show that a collision attack on MJH has the time complexity below the birthday b ..."
Abstract
- Add to MetaCart
A double-block-length (DBL) hash mode of block ciphers, MJH has been proved to be collision-resistant in the ideal cipher model upto 2 2n/3−log n queries. In this paper we provide first cryptanalytic results for MJH. We show that a collision attack on MJH has the time complexity below the birthday
Results 1 - 10
of
5,439
