; q]-codes (k >= 3, q >= 5, 1 <= µ < k-1) meeting the Griesmer bound.

Noboru Hamada Tor Helleseth

Published in: Discret. Math. (1995)

Keyphrases

upper bound
lower bound
error correction
meeting room
worst case
multi party
databases
machine learning
error correcting codes
database systems
real time
error bounds
evolutionary algorithm
logical operations
natural language processing
information systems
information retrieval
real world
data sets