Browsing by Author "Kuppusamy, L."

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    A note on ambiguity of internal contextual grammars
    (2006) Kuppusamy, L.
    In this paper, we continue the study of ambiguity of internal contextual grammars which was investigated in Ilie [On ambiguity in internal contextual languages, in: C. Martin-Vide (Ed.), Second Int. Conf. on Mathematical Linguistics, Tarragona, 1996, John Benjamins, Amsterdam, 1997, pp. 29-45] and Martin-Vide et al. [Attempting to define the ambiguity in internal contextual languages, in: C. Martin-Vide (Ed.), Second Int. Conf. on Mathematical Linguistics, Tarragona, 1996, John Benjamins, Amsterdam, 1997, pp. 59-81]. We solve some open problems formulated in these papers. The main results are: (i) there are inherently 1-ambiguous languages with respect to internal contextual grammars with arbitrary choice which are 0-unambiguous with respect to finite choice, (ii) there are inherently 2-ambiguous languages with respect to internal contextual grammars with arbitrary choice which are 1-unambiguous with respect to regular choice, and (iii) there are inherently 2-ambiguous languages with respect to depth-first internal contextual grammars with arbitrary choice which are 1-unambiguous with respect to finite choice. © 2006 Elsevier B.V. All rights reserved.
  • No Thumbnail Available
    Item
    Accelerating QKD post-processing by secure offloading of information reconciliation
    (Elsevier Ltd, 2024) Ramalingam, J.; Rath, S.; Kuppusamy, L.; Lee, C.-C.
    While quantum key distribution (QKD) offers unparalleled security in communication, its real-world application is hindered by inherent physical constraints. The challenge lies predominantly in the cumbersome, energy-intensive nature of current QKD systems, which stems largely from the time-intensive post-processing stage. This paper investigates the feasibility of offloading the computationally intensive post-processing tasks, specifically focusing on information reconciliation (IR), to potentially untrusted servers. We present a novel scheme that leverages syndrome decoding techniques to efficiently transfer the IR step of QKD protocols to a single external server. Notably, this offloading is accomplished while maintaining the highest level of security, known as unconditional security. The proposed technique is bolstered by a comprehensive theoretical analysis and validated through experimental trials. These findings demonstrate the effectiveness of our approach in bridging the gap between the theoretical promise of QKD and its real-world deployment. © 2024 Elsevier Ltd
  • Thumbnail Image
    Item
    A note on ambiguity of internal contextual grammars
    (2006) Kuppusamy, L.
    In this paper, we continue the study of ambiguity of internal contextual grammars which was investigated in Ilie [On ambiguity in internal contextual languages, in: C. Martin-Vide (Ed.), Second Int. Conf. on Mathematical Linguistics, Tarragona, 1996, John Benjamins, Amsterdam, 1997, pp. 29-45] and Martin-Vide et al. [Attempting to define the ambiguity in internal contextual languages, in: C. Martin-Vide (Ed.), Second Int. Conf. on Mathematical Linguistics, Tarragona, 1996, John Benjamins, Amsterdam, 1997, pp. 59-81]. We solve some open problems formulated in these papers. The main results are: (i) there are inherently 1-ambiguous languages with respect to internal contextual grammars with arbitrary choice which are 0-unambiguous with respect to finite choice, (ii) there are inherently 2-ambiguous languages with respect to internal contextual grammars with arbitrary choice which are 1-unambiguous with respect to regular choice, and (iii) there are inherently 2-ambiguous languages with respect to depth-first internal contextual grammars with arbitrary choice which are 1-unambiguous with respect to finite choice. 2006 Elsevier B.V. All rights reserved.