Publications associées à Finite fields And Error-Correcting Codes

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

Robert Granger

For any positive integers

n\geq 3, r\geq 1

we present formulae for the number of irreducible polynomials of degree

n

over the finite field

\mathbb{F}_{2^r}

where the coefficients of

x^{n-1}

x^{n-2}

and

x^{n-3}

are zero. Our proofs involve coun ...

Elsevier2016

Finite fields And Error-Correcting Codes

Graph Chatbot

Chattez avec Graph Search

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Arithmetic and geometric structures in cryptography

Patching And Weak Approximation In Isometry Groups

Multiple-field based code generator and decoder for communications systems

Approximation-aware Rewriting of AIGs for Error Tolerant Applications

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

Algebraic twists of modular forms and Hecke orbits

Universal Polar Codes

Arithmetic and geometric structures in cryptography

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Multiple-field based code generator and decoder for communications systems

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

Patching And Weak Approximation In Isometry Groups

Approximation-aware Rewriting of AIGs for Error Tolerant Applications

Algebraic twists of modular forms and Hecke orbits

Universal Polar Codes