92 results on '"Ilya Vorobyev"'
Search Results
2. Secure Codes With List Decoding.
3. Codes Correcting Long Duplication Errors.
4. Codes Correcting a Single Long Duplication Error.
5. Correcting One Error in Non-Binary Channels with Feedback.
6. Deterministic Identification Codes for Fading Channels.
7. Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes.
8. Wiener index and graphs, almost half of whose vertices satisfy Šoltés property.
9. Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate.
10. Secure codes with list decoding.
11. Correcting one error in channels with feedback.
12. Secure Codes with List Decoding.
13. Optimal Codes Correcting Localized Deletions.
14. Fast Decoding of Union-Free Codes.
15. Optimal Multistage Group Testing Algorithm for 3 Defectives.
16. Duplication with transposition distance to the root for q-ary strings.
17. Lifted Reed-Solomon Codes with Application to Batch Codes.
18. Feedback Insertion-Deletion Codes.
19. On Lifted Multiplicity Codes.
20. Lifted Reed-Solomon Codes and Lifted Multiplicity Codes.
21. Non-adaptive and two-stage coding over the Z-channel.
22. Note on generalized group testing.
23. A New Algorithm for Two-Stage Group Testing.
24. Constructions of Batch Codes via Finite Geometry.
25. New lower bound on the rate of traceability set systems.
26. Trivariate Lifted Codes with Disjoint Repair Groups.
27. Construction of High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes.
28. Binary Batch Codes With Improved Redundancy.
29. Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications.
30. Separable Codes for the Symmetric Multiple-Access Channel.
31. Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes.
32. Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate.
33. Separable Codes for the Symmetric Multiple-Access Channel.
34. On Capacities of the Two-User Union Channel With Complete Feedback.
35. Hypothesis Test for Bounds on the Size of Random Defective Set.
36. Hypothesis test for upper bound on the size of random defective set.
37. Almost Affinely Disjoint Subspaces.
38. Duplication with transposition distance to the root for $q$-ary strings.
39. Lifted Multiplicity Codes.
40. Symmetric disjunctive list-decoding codes.
41. Almost cover-free codes and designs.
42. Cover-free codes and separating system codes.
43. Almost affinely disjoint subspaces.
44. Bounds on the rate of superimposed codes.
45. On capacities of the two-user union channel with complete feedback.
46. Bounds for Signature Codes.
47. Floor Scale Modulo Lifting for QC-LDPC codes.
48. Bounds on the rate of disjunctive codes (in Russian).
49. Almost Cover-Free Codes.
50. Symmetric Disjunctive List-Decoding Codes.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.