Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

M. Best

dblp:09/467 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › q-ary codes
binary codes
0.011980
Binary codes with a minimum distance of four (Corresp.) · IEEE Trans. Inf. Theory 1980
Coding theory › error-correcting codes › code construction
optimal code construction
0.011980
Binary codes with a minimum distance of four (Corresp.) · IEEE Trans. Inf. Theory 1980
Coding theory
sphere packing
0.011980
Binary codes with a minimum distance of four (Corresp.) · IEEE Trans. Inf. Theory 1980
YearPublicationVenuePosition
2004 A directory service for multi-literate users
abstract
User directory services, such as a database service cataloging people in a company or community, are important components today to many online applications. Furthermore, the design of computer applications and interfaces that are appropriate to currently marginalized communities, such as those in rural and poor areas of the developing world, has become an increasingly important research area. We have developed and tested a novel user directory service made specifically for rural communities and for users with low written and computer literacy. Our system supports a new interface design that allows users to perform directory searches for people across a number of dimensions without requiring written literacy nor keyboarding skills. This user directory service was tested in a rural community of the Dominican Republic. Initial results suggest that the general user interface and iconography, was effective in supporting users with a range of written literacy and computer skills. However, results show that the Boolean query mechanism, as implemented, is difficult to master.
M. Sin, M. Escobedo, M. Best
ICME3
1980 Binary codes with a minimum distance of four (Corresp.)
abstract
A new binary code of length ten and minimum Hamming distance four is presented. It contains 40 words and is therefore optimal. It gives rise to a new sphere packing in ten dimensions. Furthermore, it is proved that a binary code of length 11 and minimum distance four cannot contain 80 words.
M. Best
IEEE Trans. Inf. Theory1