Pages that link to "Item:Q97723"

The following pages link to IEEE Transactions on Information Theory (Q97723):

Displaying 50 items.

• Optimal Nonparametric Multivariate Change Point Detection and Localization (Q97724) (← links)
• SOFAR: Large-Scale Association Network Learning (Q105495) (← links)
• On Strong Consistency of Model Selection in Classification (Q128145) (← links)
• Classification of the extremal formally self-dual even codes of length 30 (Q540389) (← links)
• Fast decoding of quasi-perfect Lee distance codes (Q851766) (← links)
• Ab initio reconstruction and experimental design for cryo electron microscopy (Q2705915) (← links)
• Higher order (nonlinear) diffraction tomography: inversion of the Rytov series (Q2705916) (← links)
• Statistical imaging and complexity regularization (Q2705917) (← links)
• Wavelet thresholding via MDL for natural images (Q2705918) (← links)
• Tiling and adaptive image compression (Q2705919) (← links)
• Kullback proximal algorithms for maximum-likelihood estimation (Q2705920) (← links)
• A statistical multiscale framework for Poisson inverse problems (Q2705921) (← links)
• Multiresolution image classification by hierarchical modeling with two-dimensional hidden Markov models (Q2705922) (← links)
• Limits to estimation in stochastic ill-conditioned inverse problems (Q2705923) (← links)
• Asymptotic global confidence regions in parametric shape estimation problems (Q2705924) (← links)
• A new upper bound on the reliability function of the Gaussian channel (Q2705925) (← links)
• On the existence and construction of good codes with low peak-to-average power ratios (Q2705926) (← links)
• Signal design for bandwidth-efficient multiple-access communications based on eigenvalue optimization (Q2705928) (← links)
• Large system performance of linear multiuser receivers in multipath fading channels (Q2705929) (← links)
• Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering (Q2705930) (← links)
• A suboptimal quadratic change detection scheme (Q2705931) (← links)
• Theorems on the variable-length intrinsic randomness (Q2705932) (← links)
• The reliability functions of the general source with fixed-length coding (Q2705933) (← links)
• Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds (Q2705935) (← links)
• Minimum-weight codewords as generators of generalized Reed-Muller codes (Q2705936) (← links)
• On the linear complexity profile of the power generator (Q2705938) (← links)
• Perfect reconstruction formulas and bounds on aliasing error in sub-Nyquist nonuniform sampling of multiband signals (Q2705939) (← links)
• A class of linear codes with good parameters (Q2705940) (← links)
• Optimal codes for single-error correction, double-adjacent-error detection (Q2705942) (← links)
• On algebraic decoding of the Z/sub 4/-linear Goethals-like codes (Q2705943) (← links)
• On the depth distribution of linear codes (Q2705944) (← links)
• A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q) (Q2705945) (← links)
• A method for convergence analysis of iterative probabilistic decoding (Q2705946) (← links)
• The super-trellis structure of turbo codes (Q2705948) (← links)
• The weight hierarchies of some product codes (Q2705949) (← links)
• A linear programming estimate of the weight distribution of BCH (255,k) (Q2705951) (← links)
• Separation of random number generation and resolvability (Q2705953) (← links)
• Universal detection of messages via finite-state channels (Q2705954) (← links)
• Reliability function of general classical-quantum channel (Q2705955) (← links)
• Macroscopic 1/f behavior of fractal signals generated by additive substitution (Q2705956) (← links)
• Fundamental limits for information retrieval (Q2705958) (← links)
• On the capacity and error-correcting codes of write-efficient memories (Q2705959) (← links)
• Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit (Q2705963) (← links)
• Coding for tolerance and detection of skew in parallel asynchronous communications (Q2705964) (← links)
• Permutation fixed points with application to estimation of minimum distance of turbo codes (Q2705967) (← links)
• A transform approach to permutation groups of cyclic codes over Galois rings (Q2705969) (← links)
• On covering radii and coset weight distributions of extremal binary self-dual codes of length 56 (Q2705970) (← links)
• Upper bounds for constant-weight codes (Q2705972) (← links)
• Optical orthogonal codes: their bounds and new optimal constructions (Q2705973) (← links)
• On identification capacity of infinite alphabets or continuous-time channels (Q2705974) (← links)