ARTÍCULO
TITULO

The Permutation Group of Affine-Invariant Extended Cyclic Codes

Berger    
T P    
Charpin    
P    

Resumen

No disponible

 Artículos similares

       
 
Shyr-Long Jeng, Rohit Roy and Wei-Hua Chieng    
Mason?s gain formula can grow factorially because of growth in the enumeration of paths in a directed graph. Each of the (n - 2)! permutation of the intermediate vertices includes a path between input and output nodes. This paper presents a novel method ... ver más
Revista: Information

 
A. S. Belozerov,B. F. Melnikov,N. P. Churikova     Pág. 23 - 30
The unsolved problem of isomorphism of graphs is directly related to one of seven so-called millenium problems: with the problem of equality of classes P and NP from the theory of algorithms. The reason of this is a lack of a sertificate algorithm for te... ver más

 
Berger, T. P.     Pág. 3016 - 3019

 
Lacan, J. Delpeyroux, E.     Pág. 2069 - 2077

 
Biglieri, E; Karlof, J K; Viterbo, E     Pág. 2204 - 2206