156 results on '"Jehoshua Bruck"'
Search Results
2. On the Information Capacity of Nearest Neighbor Representations.
3. On Algebraic Constructions of Neural Networks with Small Weights.
4. Trace Reconstruction with Bounded Edit Distance.
5. Neural Network Computations with DOMINATION Functions.
6. Synthesizing New Expertise via Collaboration.
7. Improve Robustness of Deep Neural Networks by Coding.
8. CodNN - Robust Neural Networks From Coded Classification.
9. Coding for Optimized Writing Rate in DNA Storage.
10. What is the Value of Data? on Mathematical Methods for Data Quality Estimation.
11. Syndrome Compression for Optimal Redundancy Codes.
12. Optimal Systematic t-Deletion Correcting Codes.
13. Optimal Codes for the q-ary Deletion Channel.
14. Robust Indexing - Optimal Codes for DNA Storage.
15. Download and Access Trade-offs in Lagrange Coded Computing.
16. Correcting Deletions in Multiple-Heads Racetrack Memories.
17. Optimal k-Deletion Correcting Codes.
18. On Coding Over Sliced Information.
19. Iterative Programming of Noisy Memory Cells.
20. How to Best Share a Big Secret.
21. Two Deletion Correcting Codes from Indicator Vectors.
22. Attaining the 2nd Chargaff Rule by Tandem Duplications.
23. Stash in a Flash.
24. Robust Correction of Sampling Bias using Cumulative Distribution Functions.
25. Correcting errors by natural redundancy.
26. Stopping set elimination for LDPC codes.
27. Secret sharing with optimal decoding and repair bandwidth.
28. Noise and uncertainty in string-duplication systems.
29. Secure RAID schemes from EVENODD and STAR codes.
30. On the duplication distance of binary strings.
31. Duplication-correcting codes for data storage in the DNA of living organisms.
32. Secure RAID schemes for distributed storage.
33. The capacity of some Pólya string models.
34. Reliability and hardware implementation of rank modulation flash memory.
35. Capacity and expressiveness of genomic tandem duplication.
36. A stochastic model for genomic interspersed duplication.
37. Rewriting flash memories by message passing.
38. Error correction through language processing.
39. Approximate Sorting of Data Streams with Limited Storage.
40. Polar coding for noisy write-once memories.
41. Error correction and partial information rewriting for flash memories.
42. Systematic codes for rank modulation.
43. Codes correcting erasures and deletions for rank modulation.
44. The capacity of string-duplication systems.
45. Single-deletion-correcting codes over permutations.
46. Bounds for permutation rate-distortion.
47. Error correcting code for flash memories.
48. Joint rewriting and error correction in write-once memories.
49. Sequence reconstruction for Grassmann graphs and permutations.
50. Information-theoretic study of voting systems.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.