The following pages link to Gadiel Seroussi (Q594593):
Displaying 49 items.
- On the arithmetic complexity of matrix Kronecker powers (Q594594) (← links)
- On the number of \(t\)-ary trees with a given path length (Q866964) (← links)
- On the entropy of a hidden Markov process (Q932317) (← links)
- (Q1171377) (redirect page) (← links)
- On the complexity of multiplication in finite fields (Q1171378) (← links)
- Systematic derivation of spline bases (Q1195761) (← links)
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Optimal Algorithms for Universal Random Number Generation From Finite Memory Sources (Q2978732) (← links)
- Universal Enumerative Coding for Tree Models (Q2986465) (← links)
- Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables (Q2989324) (← links)
- Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood (Q2989670) (← links)
- On the minimum distance of some quadratic residue codes (Corresp.) (Q3329382) (← links)
- A systolic Reed-Solomon encoder (Q3360788) (← links)
- Generalizations of the Normal Basis Theorem of Finite Fields (Q3483366) (← links)
- Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure (Q3547324) (← links)
- Symbol-Intersecting Codes (Q3547566) (← links)
- On universal types (Q3547604) (← links)
- Universal discrete denoising: known channel (Q3547784) (← links)
- Bounds for Binary Codes With Narrow Distance Distributions (Q3549013) (← links)
- Universal Algorithms for Channel Decoding of Uncompressed Sources (Q3604472) (← links)
- Universal Delay-Limited Simulation (Q3604979) (← links)
- On symmetric algorithms for bilinear forms over finite fields (Q3698312) (← links)
- On generator matrices of MDS codes (Corresp.) (Q3713990) (← links)
- On cyclic MDS codes of length q over GF(q) (Corresp.) (Q3722419) (← links)
- On MDS extensions of generalized Reed- Solomon codes (Q3726007) (← links)
- Encoding and decoding of BCH codes using light and short codewords (Q3799954) (← links)
- Vector sets for exhaustive testing of logic circuits (Q3799961) (← links)
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields (Q3897159) (← links)
- On the power of straight- line computations in finite fields (Q3956397) (← links)
- Explicit formulas for self-complementary normal bases in certain finite fields (Q3981158) (← links)
- (Q4265362) (← links)
- (Q4279521) (← links)
- (Q4354780) (← links)
- Sequential prediction and ranking in universal context modeling and data compression (Q4371927) (← links)
- Optimal prefix codes for sources with two-sided geometric distributions (Q4503513) (← links)
- Coding of sources with two-sided geometric distributions and unknown parameters (Q4503515) (← links)
- Asymptotically Tight Bounds on the Depth of Estimated Context Trees (Q4629936) (← links)
- On sequential strategies for loss functions with memory (Q4674553) (← links)
- Reduced-redundancy product codes for burst error correction (Q4701112) (← links)
- (Q4736431) (← links)
- Maximum likelihood decoding of certain Reed - Muller codes (Corresp.) (Q4742704) (← links)
- On Symmetric Representations of Finite Fields (Q4742936) (← links)
- (Q4858446) (← links)
- Location-correcting codes (Q4885685) (← links)
- Type Classes of Context Trees (Q5271788) (← links)
- Twice-Universal Simulation of Markov Sources and Individual Sequences (Q5281287) (← links)
- The iDUDE Framework for Grayscale Image Denoising (Q5369905) (← links)
- LATIN 2004: Theoretical Informatics (Q5901651) (← links)