We construct large caps in projective spaces of small dimension (up to 11) defined over fields of order at most 9. The constructions are both theoretical and computer-supported. S...
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
Although numerous context-aware applications have been developed and there have been technological advances for acquiring contextual information, it is still difficult to develop a...
Anind K. Dey, Timothy Sohn, Sara Streng, Justin Ko...
We propose a simple way to interact with a large screen which is situated in a public space by using a small size device. In order to get the connection information easily, we use ...