Computing in general Abelian groups is hard

Authors:
C. S Iliopoulos
Affiliations:
Warwick Univ., Coventry, UK
Venue:
Theoretical Computer Science
Year:
1985

Citing 0
Cited 3

Algorithms for computing parameters of graph-based extensions of BCH codes

Journal of Discrete Algorithms
An Algorithm for BCH Codes Extended with Finite State Automata

Fundamenta Informaticae - Workshop on Combinatorial Algorithms
An Algorithm for BCH Codes Extended with Finite State Automata

Fundamenta Informaticae - Workshop on Combinatorial Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract