The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Simon Litsyn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Uri Blass, Iiro S. Honkala, Simon Litsyn
    On tHe Size of Identifying Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:142-147 [Conf]
  2. Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
    On the Identification of Vertices and Edges Using Cycles. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:308-314 [Conf]
  3. Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen
    On Algebraic Methods in Covering Radius Problems. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:21-32 [Conf]
  4. Tali Kaufman, Simon Litsyn
    Long Extended BCH Codes Are Spanned by Minimum Weight Words. [Citation Graph (0, 0)][DBLP]
    AAECC, 2006, pp:285-294 [Conf]
  5. Françoise Levy-dit-Vehel, Simon Litsyn
    On the Covering Radius of Long Goppa Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:341-346 [Conf]
  6. Simon Litsyn
    Fast Algorithms for Decoding Orthogonal and Related Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1991, pp:39-47 [Conf]
  7. Alexei E. Ashikhmin, Simon Litsyn
    A Fast Search for the Maximum Element of the Fourier Spectrum. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:134-141 [Conf]
  8. Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.
    On Perfect Weighted Coverings with Small Radius. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:32-41 [Conf]
  9. Simon Litsyn, Alexander Vardy
    Two new upper bounds for codes of distance 3. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:253-262 [Conf]
  10. Tali Kaufman, Simon Litsyn
    Almost Orthogonal Linear Codes are Locally Testable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:317-326 [Conf]
  11. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    Binary Codes for Collusion-Secure Fingerprinting. [Citation Graph (0, 0)][DBLP]
    ICISC, 2001, pp:178-185 [Conf]
  12. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Low-Degree Polynomials over GF(2(. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:188-199 [Conf]
  13. Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.
    Covering Radius 1985-1994. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:3, pp:173-239 [Journal]
  14. Alexei E. Ashikhmin, Simon Litsyn
    Fast Decoding of Non-Binary First Order Reed-Muller Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:7, n:4, pp:299-308 [Journal]
  15. Iiro S. Honkala, Tero Laihonen, Simon Litsyn
    On Covering Radius and Discrete Chebyshev Polynomials. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:395-401 [Journal]
  16. Simon Litsyn, Oscar Moreno, Carlos J. Moreno
    Divisibility Properties and New Bounds for Cyclic Codes and Exponential Sums in One and Several Variables. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:105-116 [Journal]
  17. Simon Litsyn, Aimo Tietäväinen
    Character Sum Constructions of Constrained Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:45-51 [Journal]
  18. Uri Blass, Simon Litsyn
    Several new lower bounds for football pool systems. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  19. Uri Blass, Simon Litsyn
    The smallest covering code of length 8 and radius 2 has 12 words. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:52, n:, pp:- [Journal]
  20. Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
    Polynomial method in coding and information theory [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  21. Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
    Intersecting Codes and Separating Codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:75-83 [Journal]
  22. Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
    Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:409-419 [Journal]
  23. Simon Litsyn, Patrick Solé, René Struik
    On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:177-191 [Journal]
  24. Alexei E. Ashikhmin, Simon Litsyn
    Fast Decoding Algorithms for First Order Reed-Muller and Related Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:7, n:3, pp:187-214 [Journal]
  25. Heikki O. Hämäläinen, Iiro S. Honkala, Markku K. Kaikkonen, Simon Litsyn
    Bounds for Binary Multiple Covering Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:3, pp:251-275 [Journal]
  26. Yaron Klein, Simon Litsyn, Alexander Vardy
    Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:6, n:3, pp:219-227 [Journal]
  27. Ilia Krasikov, Simon Litsyn
    On the Distance Distributions of BCH Codes and Their Duals. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:2, pp:223-232 [Journal]
  28. Ilia Krasikov, Simon Litsyn
    Bounds on Spectra of Codes with Known Dual Distance. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:13, n:3, pp:285-297 [Journal]
  29. Tero Laihonen, Simon Litsyn
    On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:1, pp:71-80 [Journal]
  30. Simon Litsyn, Beniamin Mounits
    Improved lower bounds on sizes of single-error correcting codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:42, n:1, pp:67-72 [Journal]
  31. Uri Blass, Iiro S. Honkala, Simon Litsyn
    Bounds on identifying codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:119-128 [Journal]
  32. Simon Litsyn, Aimo Tietäväinen
    Upper Bounds on the Covering Radius of a Code with a Given Dual Distance. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:265-270 [Journal]
  33. Ilia Krasikov, Simon Litsyn
    Linear Programming Bounds for Codes of Small Size. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:6, pp:647-656 [Journal]
  34. Noga Alon, Simon Litsyn, Raphael Yuster
    A Coding Theory Bound and Zero-Sum Square Matrices. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:449-457 [Journal]
  35. Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Generalized hashing and parent-identifying codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:104, n:1, pp:207-215 [Journal]
  36. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    Binary B2-Sequences : A New Upper Bound. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:1, pp:152-155 [Journal]
  37. Henk D. L. Hollmann, János Körner, Simon Litsyn
    Tiling Hamming Space with Few Spheres. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:388-393 [Journal]
  38. Ilia Krasikov, Simon Litsyn
    On Integral Zeros of Krawtchouk Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:71-99 [Journal]
  39. Yael Ben-Haim, Simon Litsyn
    Exact Minimum Density of Codes Identifying Vertices in the Square Grid. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:69-82 [Journal]
  40. Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor
    Tilings of Binary Spaces. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:3, pp:393-412 [Journal]
  41. Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård
    Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:196-207 [Journal]
  42. Tero Laihonen, Simon Litsyn
    New Bounds On Covering Radius as a Function of Dual Distance. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:243-251 [Journal]
  43. Gregory Freiman, Simon Litsyn, Alexander Yudin
    A method to suppress high peaks in BPSK-modulated OFDM signal. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2004, v:52, n:9, pp:1440-1443 [Journal]
  44. Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
    Analysis of Low-Density Parity-Check Codes Based on EXIT Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2006, v:54, n:7, pp:1349-1349 [Journal]
  45. Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
    EXIT Functions for Binary Input Memoryless Symmetric Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2006, v:54, n:7, pp:1207-1214 [Journal]
  46. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4032-4039 [Journal]
  47. Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn
    Quantum error detection I: Statement of the problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:778-788 [Journal]
  48. Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn
    Quantum error detection II: Bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:789-800 [Journal]
  49. Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
    A new upper bound on the reliability function of the Gaussian channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:1945-1961 [Journal]
  50. Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
    Estimates of the distance distribution of codes and designs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:3, pp:1050-1061 [Journal]
  51. Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
    New Upper Bounds on Generalized Weights. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1258-1263 [Journal]
  52. Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Bounds on distance distributions in codes of known size. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:250-258 [Journal]
  53. Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
    On relations between covering radius and dual distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1808-1816 [Journal]
  54. Alexei E. Ashikhmin, Simon Litsyn
    Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:8, pp:1812-1818 [Journal]
  55. Alexei E. Ashikhmin, Simon Litsyn
    Upper Bounds on the Size of Quantum Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1206-1215 [Journal]
  56. Alexander Barg, Simon Litsyn
    DC-constrained codes from Hadamard matrices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:801-807 [Journal]
  57. Yael Ben-Haim, Simon Litsyn
    Upper bounds on the rate of LDPC codes as a function of minimum distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:2092-2100 [Journal]
  58. Uri Blass, Simon Litsyn
    Several New Lower Bounds on the Size of Codes with Covering Radius One. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1998-2002 [Journal]
  59. Mario Blaum, Simon Litsyn, Vincent Buskens, Henk C. A. van Tilborg
    Error-correcting codes with bounded running digital sum. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:216-0 [Journal]
  60. Shraga I. Bross, Simon Litsyn
    Improved Upper Bounds for Codes With Unequal Error Protection. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:7, pp:3329-3333 [Journal]
  61. David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller
    Upper bounds on the rate of LDPC Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:9, pp:2437-2449 [Journal]
  62. Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn
    On binary constructions of quantum codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2495-2498 [Journal]
  63. Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.
    Weighted coverings and packings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1856-1867 [Journal]
  64. Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé
    Long packing and covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1617-1619 [Journal]
  65. Gérard D. Cohen, Simon Litsyn
    DC-constrained error-correcting codes with small running digital sum. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:949-0 [Journal]
  66. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    Upper bounds on generalized distances. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:2090-0 [Journal]
  67. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    On the traveling salesman problem in binary Hamming spaces. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1274-1276 [Journal]
  68. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    On greedy algorithms in coding theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2053-2057 [Journal]
  69. Iwan M. Duursma, Marcus Greferath, Simon Litsyn, Stefan E. Schmidt
    A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1596-1598 [Journal]
  70. Uri Erez, Simon Litsyn, Ram Zamir
    Lattices which are good for (almost) everything. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3401-3416 [Journal]
  71. Gregory Freiman, Simon Litsyn
    Asymptotically exact bounds on the size of high-order spectral-null codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1798-1807 [Journal]
  72. Osnat Keren, Simon Litsyn
    A class of array codes correcting multiple column erasures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:1843-1851 [Journal]
  73. Osnat Keren, Simon Litsyn
    Codes Correcting Phased Burst Erasures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:416-420 [Journal]
  74. Osnat Keren, Simon Litsyn
    More on the Distance Distribution of BCH Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:251-255 [Journal]
  75. Ilia Krasikov, Simon Litsyn
    An improved upper bound on the minimum distance of doubly-even self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:274-278 [Journal]
  76. Ilia Krasikov, Simon Litsyn
    On spectra of BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:786-788 [Journal]
  77. Ilia Krasikov, Simon Litsyn
    On the accuracy of the binomial approximation to the distance distribution of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:5, pp:1472-1474 [Journal]
  78. Ilia Krasikov, Simon Litsyn
    Estimates for the range of binomiality in codes' spectra. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:3, pp:987-991 [Journal]
  79. Ilia Krasikov, Simon Litsyn
    Linear programming bounds for doubly-even self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1238-1244 [Journal]
  80. Ilia Krasikov, Simon Litsyn
    On the Distance Distribution of Duals of BCH Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:247-250 [Journal]
  81. Françoise Levy-dit-Vehel, Simon Litsyn
    More on the covering radius of BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1023-1028 [Journal]
  82. Françoise Levy-dit-Vehel, Simon Litsyn
    Parameters of Goppa codes revisited. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:1811-1819 [Journal]
  83. Simon Litsyn
    New Upper Bounds on Error Exponents. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:385-398 [Journal]
  84. Simon Litsyn, Vladimir Shevelev
    On ensembles of low-density parity-check codes: Asymptotic distance distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:887-908 [Journal]
  85. Simon Litsyn, Vladimir Shevelev
    Distance distributions in ensembles of irregular low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3140-3159 [Journal]
  86. Simon Litsyn, Michael A. Tsfasman
    A note on lower bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:5, pp:705-0 [Journal]
  87. Simon Litsyn, Alexander Vardy
    The uniqueness of the Best code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1693-0 [Journal]
  88. Simon Litsyn, Gerhard Wunder
    Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:3, pp:992-1006 [Journal]
  89. Simon Litsyn, Alexander Yudin
    Discrete and continuous maxima in multicarrier communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:919-928 [Journal]
  90. Beniamin Mounits, Tuvi Etzion, Simon Litsyn
    Improved upper bounds on sizes of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:880-886 [Journal]
  91. Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn
    A note on perfect multiple covetings of the Hamming space. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:678-0 [Journal]
  92. S. Freundlich, David Burshtein, Simon Litsyn
    Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:4, pp:1484-1494 [Journal]
  93. Gérard D. Cohen, Simon Litsyn
    On the covering radius of Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:147-155 [Journal]

  94. Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). [Citation Graph (, )][DBLP]


  95. New Upper Bounds on A(n,d) [Citation Graph (, )][DBLP]


  96. Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2). [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002