The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Simon Litsyn" ( http://dblp.L3S.de/Authors/Simon_Litsyn )

URL (Homepage):  http://www.eng.tau.ac.il/~litsyn/  Author page on DBLP  Author page in RDF  Community of Simon Litsyn in ASPL-2

Publication years (Num. hits)
1986-1994 (17) 1995-1996 (15) 1997-1998 (15) 1999-2000 (16) 2001-2003 (18) 2004-2006 (18) 2007-2008 (15) 2009-2011 (16) 2012 (1)
Publication types (Num. hits)
article(106) book(1) inproceedings(22) proceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 13 keywords

Results
Found 131 publication records. Showing 131 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals. Search on Bibsonomy IEEE Transactions on Communications The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gerhard Wunder, R. F. H. Fischer, Simon Litsyn, J. S. No Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem. Search on Bibsonomy EURASIP J. Adv. Sig. Proc. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Igal Kotzer, Simon Litsyn On the EVM computation of arbitrary clipped multi-carrier signals. Search on Bibsonomy EURASIP J. Adv. Sig. Proc. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vladimir Blinovsky, Simon Litsyn New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Noam Presman, Ofer Shapira, Simon Litsyn Binary Polar Code Kernels from Code Decompositions Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Noam Presman, Ofer Shapira, Simon Litsyn Polar Codes with Mixed Kernels Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Noam Presman, Ofer Shapira, Simon Litsyn Binary polar code kernels from code decompositions. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn On the EVM of sequences. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yuval Cassuto, Simon Litsyn Symbol-pair codes: Algebraic constructions and asymptotic bounds. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Noam Presman, Ofer Shapira, Simon Litsyn Polar codes with mixed kernels. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Simon Litsyn, Ning Xie Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2). Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vladimir Blinovsky, Uri Erez, Simon Litsyn Weight distribution moments of random linear/coset codes. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Noga Alon, Simon Litsyn, Alexander Shpunt Typical peak sidelobe level of binary sequences. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Eran Sharon, Noam Presman, Simon Litsyn Convergence analysis of generalized serial message-passing schedules. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vladimir Blinovsky, Simon Litsyn New asymptotic bounds on the size of list codes on Euclidean sphere. Search on Bibsonomy ISIT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eran Sharon, Omer Fainzilber, Simon Litsyn Decreasing error floor in LDPC codes by parity-check matrix extensions. Search on Bibsonomy ISIT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eran Sharon, Noam Presman, Simon Litsyn Analysis of LDPC decoding schedules. Search on Bibsonomy ISIT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eran Sharon, Simon Litsyn Constructing LDPC codes by error minimization progressive edge growth. Search on Bibsonomy IEEE Transactions on Communications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Alexander Shpunt On the Distribution of Boolean Function Nonlinearity. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Idan Alrod, Simon Litsyn, Alexander Yudin On PMEPR of algebraic codes. Search on Bibsonomy European Transactions on Telecommunications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Yael Ben-Haim, Simon Litsyn Improved Upper Bounds on the Reliability Function of the Gaussian Channel. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christine Bachoc, Yael Ben-Haim, Simon Litsyn Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Noam Presman, Eran Sharon, Simon Litsyn Efficient layers-based schedules for iterative decoding of LDPC codes. Search on Bibsonomy ISIT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Alexander Shpunt Typical peak sidelobe level of binary sequences. Search on Bibsonomy ISIT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Simon Litsyn, Ning Xie Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Alexander Shpunt A Balancing Method for PMEPR Reduction in OFDM Signals. Search on Bibsonomy IEEE Transactions on Communications The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Simon Litsyn, Ning Xie Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2). Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Daniel Levin, Eran Sharon, Simon Litsyn Lazy scheduling forLDPC decoding. Search on Bibsonomy IEEE Communications Letters The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Beniamin Mounits Improved lower bounds on sizes of single-error correcting codes. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2007 DBLP  DOI  BibTeX  RDF AMS Classification 94B25
1Eran Sharon, Simon Litsyn, Jacob Goldberger Efficient Serial Message-Passing Schedules for LDPC Decoding. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1S. Freundlich, David Burshtein, Simon Litsyn Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Simon Litsyn Peak power control in multicarrier communications. Search on Bibsonomy 2007   RDF
1Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn Analysis of Low-Density Parity-Check Codes Based on EXIT Functions. Search on Bibsonomy IEEE Transactions on Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn EXIT Functions for Binary Input Memoryless Symmetric Channels. Search on Bibsonomy IEEE Transactions on Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn Analysis of low-density parity-check codes based on EXIT functions. Search on Bibsonomy IEEE Transactions on Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Idan Alrod, Simon Litsyn, Alexander Yudin On the peak-to-average power ratio of M-sequences. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Yaniv Nana, Eran Sharon, Simon Litsyn Improved decoding of LDPC coded modulations. Search on Bibsonomy IEEE Communications Letters The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Yael Ben-Haim, Simon Litsyn Upper bounds on the rate of LDPC codes as a function of minimum distance. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Shraga I. Bross, Simon Litsyn Improved Upper Bounds for Codes With Unequal Error Protection. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Gerhard Wunder Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Simon Litsyn Long Extended BCH Codes Are Spanned by Minimum Weight Words. Search on Bibsonomy AAECC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Beniamin Mounits, Tuvi Etzion, Simon Litsyn New Upper Bounds on A(n,d) Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Yael Ben-Haim, Simon Litsyn Exact Minimum Density of Codes Identifying Vertices in the Square Grid. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Uri Erez, Simon Litsyn, Ram Zamir Lattices which are good for (almost) everything. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn Bounds on distance distributions in codes of known size. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron Testing Reed-Muller codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Alexander Yudin Discrete and continuous maxima in multicarrier communication. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Simon Litsyn Almost Orthogonal Linear Codes are Locally Testable. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Gregory Freiman, Simon Litsyn, Alexander Yudin A method to suppress high peaks in BPSK-modulated OFDM signal. Search on Bibsonomy IEEE Transactions on Communications The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Simon Litsyn Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn Generalized hashing and parent-identifying codes. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Noga Alon, Simon Litsyn, Raphael Yuster A Coding Theory Bound and Zero-Sum Square Matrices. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun Intersecting Codes and Separating Codes. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Vladimir Shevelev Distance distributions in ensembles of irregular low-density parity-check codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron Testing Low-Degree Polynomials over GF(2(. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Vladimir Shevelev On ensembles of low-density parity-check codes: Asymptotic distance distributions. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller Upper bounds on the rate of LDPC Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Beniamin Mounits, Tuvi Etzion, Simon Litsyn Improved upper bounds on sizes of codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Gérard D. Cohen, Simon Litsyn, Gilles Zémor Binary B2-Sequences : A New Upper Bound. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn Estimates of the Distance Distribution of Codes and Designs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn Intersecting codes and partially identifying codes. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Uri Blass, Iiro S. Honkala, Simon Litsyn Bounds on identifying codes. Search on Bibsonomy Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Ilia Krasikov, Simon Litsyn On the Distance Distributions of BCH Codes and Their Duals. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2001 DBLP  BibTeX  RDF
1Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn Estimates of the distance distribution of codes and designs. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Iwan 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. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Gérard D. Cohen, Simon Litsyn, Gilles Zémor Binary Codes for Collusion-Secure Fingerprinting. Search on Bibsonomy ICISC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Collusion-resistant code, intersecting code, B2-sequence, watermarking, Fingerprinting
1Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn On the Identification of Vertices and Edges Using Cycles. Search on Bibsonomy AAECC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF binary hypercube, Lee metric, graph, multiprocessor system, Identification, cycle, Hamming distance
1Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn Quantum error detection II: Bounds. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn A new upper bound on the reliability function of the Gaussian channel. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn Quantum error detection I: Statement of the problem. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Ilia Krasikov, Simon Litsyn An improved upper bound on the minimum distance of doubly-even self-dual codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn Polynomial method in coding and information theory Search on Bibsonomy CoRR The full citation details ... 1999 DBLP  BibTeX  RDF
1Tero Laihonen, Simon Litsyn New Bounds On Covering Radius as a Function of Dual Distance. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Uri Blass, Simon Litsyn The smallest covering code of length 8 and radius 2 has 12 words. Search on Bibsonomy Ars Comb. The full citation details ... 1999 DBLP  BibTeX  RDF
1Simon Litsyn New Upper Bounds on Error Exponents. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn On relations between covering radius and dual distance. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn New Upper Bounds on Generalized Weights. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexei E. Ashikhmin, Simon Litsyn Upper Bounds on the Size of Quantum Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn On binary constructions of quantum codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Ilia Krasikov, Simon Litsyn On the Distance Distribution of Duals of BCH Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Osnat Keren, Simon Litsyn More on the Distance Distribution of BCH Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Gregory Freiman, Simon Litsyn Asymptotically exact bounds on the size of high-order spectral-null codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Uri Blass, Iiro S. Honkala, Simon Litsyn On tHe Size of Identifying Codes. Search on Bibsonomy AAECC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Simon Litsyn, Patrick Solé, René Struik On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Uri Blass, Simon Litsyn Several new lower bounds for football pool systems. Search on Bibsonomy Ars Comb. The full citation details ... 1998 DBLP  BibTeX  RDF
1Tero Laihonen, Simon Litsyn On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Ilia Krasikov, Simon Litsyn Bounds on Spectra of Codes with Known Dual Distance. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Osnat Keren, Simon Litsyn Codes Correcting Phased Burst Erasures. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Uri Blass, Simon Litsyn Several New Lower Bounds on the Size of Codes with Covering Radius One. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Henk D. L. Hollmann, János Körner, Simon Litsyn Tiling Hamming Space with Few Spheres. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Ilia Krasikov, Simon Litsyn Linear Programming Bounds for Codes of Small Size. Search on Bibsonomy Eur. J. Comb. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr. Covering Radius 1985-1994. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Amalgamated direct sum, Blockwise direct sum, Density of coverings, Dual distance, Excess method, Sphere-covering bound, Normality, Reed-Muller codes, Covering radius, Binary codes, BCH codes
1Iiro S. Honkala, Tero Laihonen, Simon Litsyn On Covering Radius and Discrete Chebyshev Polynomials. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Dual distance, Discrete Chebyshev polynomials, Code, Covering radius
1Ilia Krasikov, Simon Litsyn Estimates for the range of binomiality in codes' spectra. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Osnat Keren, Simon Litsyn A class of array codes correcting multiple column erasures. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé Long packing and covering codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Ilia Krasikov, Simon Litsyn Linear programming bounds for doubly-even self-dual codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Françoise Levy-dit-Vehel, Simon Litsyn Parameters of Goppa codes revisited. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Ilia Krasikov, Simon Litsyn On Integral Zeros of Krawtchouk Polynomials. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 131 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.