The following pages link to Jørn Justesen (Q2364842):
Displaying 50 items.
- (Q1280736) (redirect page) (← links)
- Decoding concatenated codes with inner convolutional codes (Q1280739) (← links)
- A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound (Q1344098) (← links)
- Combinatorial entropy of images (Q1386622) (← links)
- A course in error-correcting codes. (Q1422079) (← links)
- A course in error-correcting codes (Q2364843) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- Bounds on the capacity of constrained two-dimensional codes (Q2706000) (← links)
- The Minimum Distance of Graph Codes (Q3005590) (← links)
- (Q3214796) (← links)
- Maxentropic Markov chains (Corresp.) (Q3334738) (← links)
- Quasi-cyclic unit memory convolutional codes (Q3483227) (← links)
- Upper Bounds on the Number of Errors Corrected by a Convolutional Code (Q3547091) (← links)
- Fields From Markov Chains (Q3547092) (← links)
- Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm (Q3548258) (← links)
- Iterative List Decoding of Some LDPC Codes (Q3549074) (← links)
- Bounds on distances and error exponents of unit memory codes (Q3669302) (← links)
- Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.) (Q3726015) (← links)
- Double series representation of bounded signals (Q3804597) (← links)
- Concatenated codes with convolutional inner codes (Q3818255) (← links)
- Information rates and power spectra of digital codes (Q3937276) (← links)
- Fast decoding of codes from algebraic plane curves (Q3991394) (← links)
- (Q4041438) (← links)
- (Q4041439) (← links)
- On maximum-distance-separable convolutional codes (Corresp.) (Q4063322) (← links)
- An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.) (Q4066976) (← links)
- Some long cyclic linear binary codes are not so bad (Q4068576) (← links)
- On the complexity of decoding Reed-Solomon codes (Corresp.) (Q4081130) (← links)
- On probabilistic context-free grammars that achieve capacity (Q4135389) (← links)
- (Q4159305) (← links)
- Finite state predictors for Gaussian sequences (Q4170637) (← links)
- Determinants of a class of Toeplitz matrices. (Q4183854) (← links)
- On the number of correctable errors for some AG-codes (Q4202098) (← links)
- Bounded distance decoding of unit memory codes (Q4307374) (← links)
- (Q4460806) (← links)
- (Q4535934) (← links)
- Concatenated codes with fixed inner code and random outer code (Q4544479) (← links)
- Bounds on list decoding of MDS codes (Q4544597) (← links)
- Calculation of power spectra for block coded signals (Q4552946) (← links)
- Some constructions of generalised concatenated codes based on unit memory codes (Q4608517) (← links)
- Critical lengths of error events in convolutional codes (Q4701136) (← links)
- Entropy bounds for constrained two-dimensional random fields (Q4701246) (← links)
- Construction and decoding of a class of algebraic geometry codes (Q4735143) (← links)
- Ternary sequences with perfect periodic autocorrelation (Corresp.) (Q4742688) (← links)
- (Q4857239) (← links)
- Fast decoding of algebraic-geometric codes up to the designed minimum distance (Q4880292) (← links)
- Block Pickard Models for Two-Dimensional Constraints (Q4974022) (← links)
- Two-Dimensional Information Theory and Coding (Q5320676) (← links)
- Polynomial weights and code constructions (Q5661390) (← links)
- New convolutional code constructions and a class of asymptotically good time-varying codes (Q5668361) (← links)
