• On interpolation-based decoding of a class of maximum rank distance codes 

      Kadir, Wrya Karim Kadir; Li, Chunlei; Zullo, Ferdinando (Journal article; Peer reviewed, 2021)
      In this paper we present an interpolation-based decoding algorithm to decode a family of maximum rank distance codes proposed recently by Trombetti and Zhou. We employ the properties of the Dickson matrix associated with ...
    • On Isotopic Shift Construction for Planar Functions 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude; Coulter, Robert; Villa, Irene (Chapter; Peer reviewed, 2019)
      CCZ-equivalence is the most general currently known equivalence relation for functions over finite fields preserving planarity and APN properties. However, for the particular case of quadratic planar functions isotopic ...
    • On iterative decoding of high-density parity-check codes using edge-local complementation 

      Knudsen, Joakim Grahl (Doctoral thesis, 2010-11-24)
      The overall topic of this work is a graph operation known as edgelocal complementation (ELC) and its applications to iterative decoding of classical codes. Although these legacy codes are arguably not well-suited for ...
    • On KDE-based brushing in scatterplots and how it compares to CNN-based brushing 

      Fan, Chaoran; Hauser, Helwig (Chapter, 2019)
      In this paper, we investigate to which degree the human should be involved into the model design and how good the empirical model can be with more careful design. To find out, we extended our previously published Mahalanobis ...
    • On Neural Associative Memory Structures: Storage and Retrieval of Sequences in a Chain of Tournaments 

      Abolpour Mofrad, Asieh; Abolpour Mofrad, Samaneh; Yazidi, Anis; Parker, Matthew Geoffrey (Journal article; Peer reviewed, 2021)
      Associative memories enjoy many interesting properties in terms of error correction capabilities, robustness to noise, storage capacity, and retrieval performance, and their usage spans over a large set of applications. ...
    • On offshore wind farm maintenance scheduling for decision support on vessel fleet composition 

      Gutierrez-Alcoba, Alejandro; Hendrix, Eligius M.T.; Lopez, Gloria Ortega; Halvorsen-Weare, Elin Espeland; Haugland, Dag (Peer reviewed; Journal article, 2019)
      Maintenance costs account for a large part of the total cost of an offshore wind farm. Several models have been presented in the literature to optimize the fleet composition of the required vessels to support maintenance ...
    • On Perturbation Resilience of Non-uniform k-Center 

      Bandyapadhyay, Sayan (Journal article; Peer reviewed, 2021)
      The Non-Uniform k-center (NUkC) problem has recently been formulated by Chakrabarty et al. [ICALP, 2016; ACM Trans Algorithms 16(4):46:1–46:19, 2020] as a generalization of the classical k-center clustering problem. In ...
    • On properties of bent and almost perfect nonlinear functions 

      Davidova, Diana (Doctoral thesis, 2021-09-14)
      (Vectorial) Boolean functions play an important role in all domains related to computer science, and in particular, in cryptography. The safety of a cryptosystem is quantified via some characteristics of (vectorial) Boolean ...
    • On properties of translation groups in the affine general linear group with applications to cryptography 

      Calderini, Marco; Civino, Roberto; Sala, Massimiliano (Journal article; Peer reviewed, 2021)
      The affine general linear group acting on a vector space over a prime field is a well-understood mathematical object. Its elementary abelian regular subgroups have recently drawn attention in applied mathematics thanks to ...
    • On relations between CCZ- and EA-equivalences 

      Villa, Irene; Calderini, Marco; Budaghyan, Lilya (Peer reviewed; Journal article, 2020)
      In the present paper we introduce some sufficient conditions and a procedure for checking whether, for a given function, CCZ-equivalence is more general than EA-equivalence together with taking inverses of permutations. ...
    • On Self-Dual Quantum Codes, Graphs, and Boolean Functions 

      Danielsen, Lars Eirik (Master thesis, 2005)
      A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing ...
    • On shared use of renewable stocks 

      Ekerhovd, Nils-Arne; Flåm, Sjur Didrik; Steinshamn, Stein Ivar (Journal article; Peer reviewed, 2020)
      Considered here is multi-party exploitation of common property, renewable resources. The parties play various dynamic games differing in degree of cooperation and commitment. Comparisons of steady states clarify issues on ...
    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (Chapter; Peer reviewed, 2016)
      Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...
    • On Supergraphs Satisfying CMSO Properties 

      Oliveira, Mateus De Oliveira (Journal article; Peer reviewed, 2021)
      Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function f, there is an algorithm A that takes as input a CMSO sentence φ, a positive integer t, and ...
    • On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving. 

      Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Wagner, Paul Stankovski (Peer reviewed; Journal article, 2019)
    • On the behavior of some APN permutations under swapping points 

      Budaghyan, Lilya; Kaleyski, Nikolay Stoyanov; Riera, Constanza Susana; Stanica, Pantelimon (Journal article; Peer reviewed, 2022)
      We define the pAPN-spectrum (which is a measure of how close a function is to being APN) of an (n, n)-function F and investigate how its size changes when two of the outputs of a given function F are swapped. We completely ...
    • On the Boomerang Uniformity of some Permutation Polynomials 

      Calderini, Marco; Villa, Irene (Journal article; Peer reviewed, 2020)
      The boomerang attack, introduced by Wagner in 1999, is a cryptanalysis technique against block ciphers based on differential cryptanalysis. In particular it takes into consideration two differentials, one for the upper ...
    • On the Classification of Hermitian Self-Dual Additive Codes over GF(9) 

      Danielsen, Lars Eirik (Peer reviewed; Journal article, 2012-08)
      Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. ...
    • On the Complexity of Intersection Non-emptiness for Star-Free Language Classes 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; Hoffmann, Stefan; Holzer, Markus; Jecker, Ismaël; Oliveira, Mateus De Oliveira; Wolf, Petra (Journal article; Peer reviewed, 2021)
      In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the ...
    • On the Complexity of Recovering Incidence Matrices 

      Fomin, Fedor; Golovach, Petr; Misra, Pranabendu; Ramanujan, M.S. (Journal article; Peer reviewed, 2020)
      The incidence matrix of a graph is a fundamental object naturally appearing in many applications, involving graphs such as social networks, communication networks, or transportation networks. Often, the data collected about ...