Result 1 to 20 of 776 total
Learning binary hash codes for large-scale image search. (English)
Cipolla, Roberto (ed.) et al., Machine learning for computer vision. Selected papers based on the presentations at the international computer vision summer school (ICVSS 2012), Sicily, Italy, July 7‒15, 2012. Berlin: Springer (ISBN 978-3-642-28660-5/hbk; 978-3-642-28661-2/ebook). Studies in Computational Intelligence 411, 49-87 (2013).
1
Structural properties of binary propelinear codes. (English)
Adv. Math. Commun. 6, No. 3, 329-346 (2012).
2
Combinatorial batch codes: A lower bound and optimal constructions. (English)
Adv. Math. Commun. 6, No. 2, 165-174 (2012).
3
Complete m-spotty weight enumerators of binary codes, Jacobi forms, and partial Epstein zeta functions. (English)
Discrete Math. 312, No. 2, 265-278 (2012).
4
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal. (English)
Adv. Math. Commun. 5, No. 4, 681-686 (2011).
5
On a problem posed by R. Salvati-Manni. (English)
Acta Arith. 150, No. 1, 1-22 (2011).
6
On the performance of binary extremal self-dual codes. (English)
Adv. Math. Commun. 5, No. 2, 267-274 (2011).
7
On lattices, binary codes, and network codes. (English)
Adv. Math. Commun. 5, No. 2, 225-232 (2011).
8
Perfect state transfer in cubelike graphs. (English)
Linear Algebra Appl. 435, No. 10, 2468-2474 (2011).
9
Codes and combinatorial structures from circular planar nearrings. (English)
Winkler, Franz (ed.), Algebraic informatics. 4th international conference, CAI 2011, Linz, Austria, June 21‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21492-9/pbk). Lecture Notes in Computer Science 6742, 115-126 (2011).
10
Faster 2-regular information-set decoding. (English)
Chee, Yeow Meng (ed.) et al., Coding and cryptology. Third international workshop, IWCC 2011, Qingdao, China, May 30 ‒ June 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20900-0/pbk). Lecture Notes in Computer Science 6639, 81-98 (2011).
11
Codes over $R_k$, Gray maps and their binary images. (English)
Finite Fields Appl. 17, No. 3, 205-219 (2011).
12
Special classes of separable Goppa codes with improved parameter estimates. (English)
Probl. Inf. Transm. 46, No. 3, 225-244 (2010); translation from Probl. Peredachi Inf. 46, No. 3, 29-50 (2010).
13
On reconstruction of binary codes by dimensions of their subcodes. (Russian)
Diskretn. Anal. Issled. Oper. 17, No. 5, 15-21 (2010).
14
Relationship between code loops and some other loops. (English)
NUMTA Bull. 4, 45-52 (2010).
15
Binary codes from the line graphs of complete tripartite graphs $K_{n_1,n_2,n_3}$. (Chinese)
J. Zhengzhou Univ., Nat. Sci. Ed. 42, No. 4, 8-13 (2010).
16
Linearly bounded liars, adaptive covering codes, and deterministic random walks. (English)
J. Comb. 1, No. 3-4, 307-333 (2010).
17
Bounds for binary codes relative to pseudo-distances of $k$ points. (English)
Adv. Math. Commun. 4, No. 4, 547-565 (2010).
18
On the least covering radius of binary linear codes of dimension 6. (English)
Adv. Math. Commun. 4, No. 3, 399-404 (2010).
19
Binary divisible codes of maximum dimension. (English)
Int. J. Inf. Coding Theory 1, No. 4, 355-370 (2010).
20
Result 1 to 20 of 776 total
Start
Contact
Print
General Help
