38 results on '"Bassalygo, L. A."'
Search Results
2. Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound
3. Symmetric Block Designs and Optimal Equidistant Codes
4. RETRACTED ARTICLE: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo
5. On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes
6. Retraction Note: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo
7. Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes
8. Optimal almost equisymbol codes based on difference matrices
9. Multiple-access hyperchannel
10. On divisibility of exponential sums of polynomials of special type over fields of characteristic 2
11. Supports of a code
12. Exact values of the sums of multiplicative characters of polynomials over finite fields
13. A model of restricted asynchronous multiple access in the presence of errors
14. Polynomials of special form over a finite field with an exact value of the trigonometric sum
15. The Grey-Rankin bound for nonbinary codes
16. On Polynomials of Special Form over a Finite Field of Odd Characteristic Attaining the Weil Bound
17. Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback
18. On Polynomials over a Finite Field of Even Characteristic with Maximum Absolute Value of the Trigonometric Sum
19. Correction of Ordinary and Localized Errors
20. On the number of nonzero permanents over a finite field of odd characteristic
21. Supports of a code
22. On m-Quasi-resolvable Block Designs and q-ary Constant-Weight Codes
23. Erratum to: “Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes”
24. Lower bound of overall exponential sums for polynomialsϕ(x d )
25. A necessary condition for the existence of perfect codes in Lie metric
26. One Class of Permutation Polynomials over Finite Fields of even Characteristic
27. Some simple consequences of coding theory for combinatorial problems of packings and coverings
28. Note on "Smaller Explicit Superconcentrators" by N. Alon and M. Capalbo.
29. On divisibility of exponential sums of polynomials of special type over fields of characteristic 2
30. Asymptotically optimal binary codes of polynomial complexity correcting localized errors
31. Binary constant-weight codes correcting localized errors and defects
32. Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]
33. On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound.
34. Polynomials of special form over a finite field with maximum modulus of the trigonometric sum
35. Lower bound of overall exponential sums for polynomials ϕ( x).
36. Codes with forbidden distances
37. Lower bound of overall exponential sums for polynomialsϕ(xd)
38. Nonstandard coding method for nonbinary codes correcting localized errors.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.