 | 2011 |
|---|
| 19 |       | Yuri L. Borissov:
On a Connection between Ideal Two-level Autocorrelation and Almost Balancedness of $p$-ary Sequences
CoRR abs/1103.3580: (2011) |
| 2010 |
|---|
| 18 | | Thomas W. Cusick,
Yuri L. Borissov:
A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code.
Discrete Mathematics 310(24): 3537-3543 (2010) |
| 2009 |
|---|
| 17 | | Moon Ho Lee,
Yuri L. Borissov:
On Jacket transforms over finite fields.
ISIT 2009: 2803-2807 |
| 16 | | Yuri L. Borissov:
On the Cusick-Cheon Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code.
IEEE Transactions on Information Theory 55(1): 16-18 (2009) |
| 2008 |
|---|
| 15 | | Yuri L. Borissov:
On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code
CoRR abs/0802.3437: (2008) |
| 14 | | Moon Ho Lee,
Yuri L. Borissov:
Fast Decoding of the p-Ary First-Order Reed-Muller Codes Based On Jacket Transform.
IEICE Transactions 91-A(3): 901-904 (2008) |
| 2007 |
|---|
| 13 | | Yuri L. Borissov,
Moon Ho Lee,
Svetla Nikova:
On Asymptotic Behavior of the Ratio Between the Numbers of Binary Primitive and Irreducible Polynomials.
IACR Cryptology ePrint Archive 2007: 301 (2007) |
| 12 | | Yuri L. Borissov,
Moon Ho Lee:
Bounds on Key Appearance Equivocation for Substitution Ciphers.
IEEE Transactions on Information Theory 53(6): 2294-2296 (2007) |
| 2006 |
|---|
| 11 | | Yuri L. Borissov,
Moon Ho Lee:
Bounds on Key Appearance Equivocation for Substitution Ciphers
CoRR abs/cs/0612064: (2006) |
| 10 | | An Braeken,
Yuri L. Borissov,
Svetla Nikova,
Bart Preneel:
Classification of cubic (n-4)-resilient Boolean functions.
IEEE Transactions on Information Theory 52(4): 1670-1676 (2006) |
| 2005 |
|---|
| 9 | | An Braeken,
Yuri L. Borissov,
Svetla Nikova,
Bart Preneel:
Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties.
ICALP 2005: 324-334 |
| 8 | | An Braeken,
Yuri L. Borissov,
Svetla Nikova,
Bart Preneel:
Classification of Cubic (n-4)-resilient Boolean Functions.
IACR Cryptology ePrint Archive 2005: 332 (2005) |
| 7 | | Yuri L. Borissov,
An Braeken,
Svetla Nikova,
Bart Preneel:
On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions.
IEEE Transactions on Information Theory 51(3): 1182-1189 (2005) |
| 2004 |
|---|
| 6 | | Yuri L. Borissov,
An Braeken,
Svetla Nikova:
Covering Radius of the (n-3)-rd Order Reed-Muller Code in the Set of Resilient Functions.
IACR Cryptology ePrint Archive 2004: 202 (2004) |
| 5 | | An Braeken,
Yuri L. Borissov,
Svetla Nikova,
Bart Preneel:
Classification of Boolean Functions of 6 Variables or Less with Respect to Cryptographic Properties.
IACR Cryptology ePrint Archive 2004: 248 (2004) |
| 2003 |
|---|
| 4 | | Yuri L. Borissov,
An Braeken,
Svetla Nikova,
Bart Preneel:
On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions.
IMA Int. Conf. 2003: 82-92 |
| 3 | | Yuri L. Borissov,
Nickolai Manev,
Svetla Nikova:
On the Non-minimal Codewords in Binary Reed-Muller Codes.
Discrete Applied Mathematics 128(1): 65-74 (2003) |
| 2002 |
|---|
| 2 | | Yuri L. Borissov,
Svetla Nikova,
Bart Preneel,
Joos Vandewalle:
On a Resynchronization Weakness in a Class of Combiners with Memory.
SCN 2002: 164-173 |
| 2001 |
|---|
| 1 | | Yuri L. Borissov,
Nickolai Manev,
Svetla Nikova:
On the Non-Minimal codewords of weight 2dmin in the binary Reed-Muller Code.
Electronic Notes in Discrete Mathematics 6: 548-555 (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page