Menu:

Κρυπτογραφία & Κωδικοποίηση


Δημοσιεύσεις σε Περιοδικά

  1. N. Kalouptsidis and M. Manolarakis, "Sequences of linear feedback shift registers with nonlinear feed-forward logic", Proceedings of IEEE, vol. 16, pp. 174-176, 1983.

  2. D. Linardatos and N. Kalouptsidis, "Synthesis of minimal cost nonlinear feedback shift registers", Signal Processing, Vol. 82, pp. 157-176, February 2002.

  3. N.Kolokotronis, P.Rizomiliotis and N.Kalouptsidis, "Minimum Linear Span Approximation of Binary Sequences", IEEE Transactions on Information Theory, Vol. 48, No. 10, pp. 2758-2764, October 2002.

  4. N. Kolokotronis and N. Kalouptsidis, "On the linear complexity of nonlinearly filtered PN-sequences", IEEE Transactions on Information Theory, pp. 3047-3059, no.11, vol. 49, Nov. 2003

  5. N. Kolokotronis, G. Gatt, and N. Kalouptsidis, "On the generation of sequences simulating higher order white noise for system identification",Signal Processing, pp. 833-852, no. 5, vol. 84, May 2004, Elsevier Science.

  6. P. Rizomiliotis and N. Kalouptsidis, "Results on the nonlinear span of binary sequences", IEEE Transactions on Information Theory, pp. 1555-1563, no. 4, vol. 51, Apr. 2005.

  7. P. Rizomiliotis, N. Kolokotronis and N. Kalouptsidis, "On the quadratic span of binary sequences", IEEE Transactions on Information Theory, pp. 1840-1848, no. 5, vol. 51, May 2005.

  8. K. Limniotis, N. Kolokotronis and N. Kalouptsidis, "On the nonlinear complexity and Lempel?Ziv complexity of finite length sequences", IEEE Trans. Inform Theory , Vol. 53, No. 11, pp. 4293-4302, 2007.

  9. K. Limniotis, N. Kolokotronis and N. Kalouptsidis, "On the linear complexity of sequences obtained by state-space generators", IEEE Trans. Inform Theory, Vol. 54, No. 4, pp. 1786-1793, 2008.

  10. N. Kolokotronis, K. Limniotis and N. Kalouptsidis, "Factorization of determinants over finite fields and applications in stream ciphers", CRYPT. AND COM., 2008.

  11. K. Xenoulis, and N. Kalouptsidis, "Improvement of Gallager Upper Bound and its variations for discrete channels", IEEE Trans. Inf. Theory, vol. 55, pp. 4204-4210, Sep. 2009.

  12. T. Etzion, N. Kalouptsidis, N. Kolokotronis, K. Limniotis, and K.G. Paterson, " Properties of the error linear complexity spectrum", IEEE Trans. on Information Theory, Vol. 55, No. 10, pp. 4681-4686, Oct. 2009.

  13. N. Kolokotronis , K. Limniotis and N. Kalouptsidis, " Best affine and quadratic approximations of particular classes of boolean functions", IEEE Trans. on Information Theory, Vol. 55, No. 11, pp. 5211-5222, Nov. 2009.

  14. A. Katsiotis, P. Rizomiliotis, and N. Kalouptsidis, "New constructions of high performance low complexity convolutional codes", IEEE Trans. on Communications, vol. 58, pp. 1950-1961, July 2010.

  15. K. Xenoulis and N. Kalouptsidis, "Achievable rates for nonlinear Volterra channels ", IEEE Trans. Inf. Theory, vol. 57, pp. 1237?1248, Mar. 2011.

  16. A. Katsiotis and N. Kalouptsidis, "On (n, n-1) punctured convolutional codes and their trellis modules", to appear in IEEE Trans. on Communications, vol. 59, pp. 1213 - 1217, May 2011.

  17. K. Xenoulis and N. Kalouptsdis, "Tight Performance Bounds for Permutation Invariant Binary Linear Block Codes Over Symmetric Channels," IEEE Trans. Inf. Theory, vol. 57, no. 9, pp.6015-6024, Sept. 2011

  18. A. Katsiotis, P. Rizomiliotis, and N. Kalouptsidis, "Flexible Convolutional Codes: Variable Rate and Complexity," IEEE Transactions on Communications, vol. COM - 60, pp. 608 - 613, March 2012.


Δημοσιεύσεις σε Συνέδρια

  1. N.Kolokotronis, P.Rizomiliotis and N.Kalouptsidis, "First-Order Optimal Approximation of Binary Sequences", in Proc. of SETA 2001, Bergen, Norway.

  2. P.Rizomiliotis, N.Kolokotronis and N.Kalouptsidis, "Construction of Sequences with four-valued Autocorrelation from GMW Sequences", ISIT 2002, Lausanne, Switzerland.

  3. N. Kolokotronis, G. Gatt, N. Kalouptsidis, "On the generation of sequences simulating higher order white noise for system identification", EUSIPCO 2002, Toulouse, France, 3-6 September 2002.

  4. D. Linardatos, N. Kalouptsidis, "Synthesis of minimal cost nonlinear feedback shift registers", EUSIPCO 2002, Toulouse, France, 3-6 September 2002.

  5. P. Rizomiliotis, N. Kolokotronis and N. Kalouptsidis, "On the quadratic span of binary sequences", IEEE International Symposium on Information Theory, Jun. 29- Jul. 4, 2003, Yokohoma, Japan

  6. P. Rizomiliotis, and N. Kalouptsidis, "Result on the nonlinear span of binary sequences", in proceedings of 2004 IEEE International Symposium on Information Theory, pp.124, Jun. 2004.

  7. N. Kalouptsidis and K. Limniotis, "Nonlinear Span, Minimal Realizations of Sequences Over Finite Fields and De Brujin Generators", International Symposium on Information Theory and its Applications, pp. 794-799, Oct. 2004

  8. K. Limniotis, N. Kolokotronis and N. Kalouptsidis, "New Results on the Linear Complexity of Binary Sequences", IEEE International Symposium on Information Theory (ISIT), pp. 2003-2007, July 2006.

  9. K. Limniotis, N. Kolokotronis and N. Kalouptsidis, "Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression", in Sequences and Their Applications (SETA), Berlin, Germany: Springer-Verlag, vol. 4086, pp. 168-179, Sept. 2006.

  10. N. Kolokotronis, K. Limniotis and N. Kalouptsidis, "Lower Bounds on Sequence Complexity via Generalised Vandermonde Determinants", in Sequences and Their Applications (SETA), Berlin, Germany: Springer-Verlag, vol. 4086, pp. 271-284, Sept. 2006.

  11. N. Kolokotronis, K. Limniotis and N. Kalouptsidis, "Improved Bounds on the Linear Complexity of keystreams Obtained by Filter Generators", in Inscrypt, 2007.

  12. N. Kolokotronis, K. Limniotis and N. Kalouptsidis, "Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions", in IMA, 2007.

  13. N. Kolokotronis, K. Limniotis, and N. Kalouptsidis, "Best affine approximations of Boolean functions and applications to low order approximations", IEEE International Symposium on Information Theory (ISIT), June 2007.

  14. T. Etzion, N. Kalouptsidis, N. Kolokotronis, K. Limniotis, and K.G. Paterson, "On the error linear complexity profiles of binary syquences of period 2^n", IEEE International Symposium on Information Theory (ISIT), July 2008.

  15. A. Katsiotis, P. Rizomiliotis, and N. Kalouptsidis, "New constructions of low complexity convolutional codes", in IEEE Proc. ICC, June 2009.

  16. K. Xenoulis and N. Kalouptsidis, "On the random coding exponent of nonlinear Gaussian channels", in IEEE Proc. ITW workshop, June 2009.

  17. K. Limniotis, N. Kolokotronis, and N. Kalouptsidis, "Constructing boolean functions in odd number of variables with maximum algebraic immunity", in proc. of IEEE International Symposium on Information Theory, pp. 2662?2666, 2011.

  18. N. Kalouptsidis and N. Kolokotronis, "Fast decoding of regular LDPC codes using greedy approximation algorithms", in proc. of IEEE International Symposium on Information Theory, pp. 2011?2015, 2011.

  19. K. Xenoulis, N. Kalouptsidis and I. Sason, "New achievable rates for nonlinear Volterra Channels via Martingale Inequalities", IEEE ISIT 2012, Boston, USA.

  20. A. Katsiotis, N. Kalouptsidis, and P. Rizomiliotis, "Recursive Flexible Convolutional Encoders for Parallel Concatenation", 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), Gothenburg, Sweden, August 2012.