The following pages link to Robert J. McEliece (Q1846384):
Displaying 50 items.
- (Q1199601) (redirect page) (← links)
- Some VLSI decompositions of the de Bruijn graph (Q1199602) (← links)
- Hiding and covering in a compact metric space (Q1846385) (← links)
- Euler products, cyclotomy, and coding (Q2551784) (← links)
- Weight congruence for p-ary cyclic codes (Q2557218) (← links)
- Covering tori with squares (Q2559386) (← links)
- (Q2776526) (← links)
- On the Average Complexity of Reed–Solomon List Decoders (Q2989321) (← links)
- Performance of sphere decoding of block codes (Q3299002) (← links)
- Channels with block interference (Q3313773) (← links)
- Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes (Q3374406) (← links)
- The Combinatorics of Differentiation (Q3600435) (← links)
- (Q3699600) (← links)
- Some Information Theoretic Saddlepoints (Q3699601) (← links)
- An entropy maximization problem related to optical communication (Corresp.) (Q3724222) (← links)
- On the decoder error probability for Reed - Solomon codes (Corresp.) (Q3757830) (← links)
- On the existence of optimum cyclic burst- correcting codes (Q3762221) (← links)
- The capacity of the Hopfield associative memory (Q3768809) (← links)
- On the capacity of channels with block memory (Q3798586) (← links)
- Two-dimensional burst identification codes and their use in burst correction (Q3799955) (← links)
- (Q3813755) (← links)
- Finite-state codes (Q3818246) (← links)
- The Renyi redundancy of generalized Huffman codes (Q3818256) (← links)
- (Q3870824) (← links)
- The constantinrao construction for binary asymmetric error-correcting codes (Q3879177) (← links)
- (Q3881618) (← links)
- Correlation properties of sets of sequences derived from irreducible cyclic codes (Q3899942) (← links)
- (Q3905201) (← links)
- Efficient universal noiseless source codes (Q3908920) (← links)
- Asynchronous multiple-access channel capacity (Q3910432) (← links)
- A Turán Inequality Arising in Information Theory (Q3940100) (← links)
- (Q3999990) (← links)
- Performance of binary block codes at low signal-to-noise ratios (Q4024546) (← links)
- A low-rate improvement on the Elias bound (Corresp.) (Q4053458) (← links)
- Zeros of Functions in Finite Abelian Group Algebras (Q4115221) (← links)
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities (Q4135374) (← links)
- There is no MacWilliams identity for convolutional codes (Corresp.) (Q4140850) (← links)
- An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.) (Q4145592) (← links)
- On the inherent intractability of certain coding problems (Corresp.) (Q4156300) (← links)
- (Q4156696) (← links)
- A Property of Euclid’s Algorithm and an Application to Padé Approximation (Q4163293) (← links)
- Symbol synchronization in convolutionally coded systems (Corresp.) (Q4178916) (← links)
- Phased burst error-correcting array codes (Q4202100) (← links)
- (Q4242019) (← links)
- A VLSI decomposition of the deBruijn graph (Q4302796) (← links)
- Performance limits for channelized cellular telephone systems (Q4307268) (← links)
- (Q4354772) (← links)
- (Q4462133) (← links)
- (Q4502607) (← links)
- The generalized distributive law (Q4503558) (← links)
