Expertini Research Research

Browse Research Papers

318+ open-access research outputs.

✕ Clear
🔍 simon koch 📂 Computer Science
Showing 318 results for "simon koch" in Computer Science
Computer Science Preprint PDF DOI

Joint Transceiver Orientation Optimization for Rotatable-Antenna MIMO Capacity Maximization

Zheng Ailing, Wu Qingqing, Peng Xingxiang, Peng Qiaoyan, Zheng Ziyuan, Chen Wen · 2026

Conventional multiple-input multiple-output (MIMO) systems mainly rely on fixed antenna arrays, which limits their capability to adapt the effective channel matrix to the propagation environment. Rota…

Read Paper →
Computer Science Preprint PDF DOI

The Josehedron: A space-filling plesiohedron based on the Fischer-Koch S Triply Periodic Minimal Surface

Mathias Bernhard · 2026

This paper presents a novel space-filling polyhedron (SFPH), here named the Josehedron, derived from the extremal points of the Fischer-Koch S triply periodic minimal surface (TPMS). The Josehedron is…

Read Paper →
Computer Science Preprint PDF DOI

Determinacy with Priorities up to Clocks

Luigi Liquori (Centre Inria de l'Universite Cote d'Azur), Michael Mendler (University of Bamberg), Claude Stolze (University of Bamberg) · 2026

In Milner's seminal book on communication and concurrency introducing CCS, a process algebra inherently non-deterministic, chapter 11 was completely devoted to introduce the notion of determinacy and …

Read Paper →
Computer Science Preprint PDF DOI

(Sets of ) Complement Scattered Factors

Duncan Adamson, Pamela Fleischmann, Annika Huch · 2026

Starting in the 1970s with the fundamental work of Imre Simon, \emph{scattered factors} (also known as subsequences or scattered subwords) have remained a consistently and heavily studied object. The …

Read Paper →
Computer Science Preprint PDF DOI

Communication Complexity of Disjointness under Product Distributions

Zach Hunter, Aleksa Milojevic, Benny Sudakov, Istvan Tomon · 2026

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of Babai, Frankl, and Si…

Read Paper →
Computer Science Preprint PDF DOI

Impact of Differentials in SIMON32 Algorithm for Lightweight Security of Internet of Things

Jonathan Cook, Sabih ur Rehman, M. Arif Khan · 2026

SIMON and SPECK were among the first efficient encryption algorithms introduced for resource-constrained applications. SIMON is suitable for Internet of Things (IoT) devices and has rapidly attracted …

Read Paper →
Computer Science Preprint PDF DOI

Polynomial Constructions and Deletion-Ball Geometry for Multiset Deletion Codes

Avraham Kreindel, Isaac Barouch Essayag, Aryeh Lev Zabokritskiy (Yohananov) · 2026

We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet under the deletion metric, motivated by permutation channels in which ordering is compl…

Read Paper →
Computer Science Preprint PDF DOI

Duality and decoding of linearized Algebraic Geometry codes

Elena Berardini, Xavier Caruso, Fabrice Drain · 2026

We design a polynomial time decoding algorithm for linearized Algebraic Geometry codes with unramified evaluation places, a family of sum-rank metric evaluation codes on division algebras over functio…

Read Paper →
Computer Science Preprint PDF DOI

A Case Study on Runtime Verification of a Continuous Deployment Process

Shoma Ansai, Masaki Waga · 2026

We report our experience in applying runtime monitoring to a FluxCD-based continuous deployment (CD) process. Our target system consists of GitHub Actions, GitHub Container Registry (GHCR), FluxCD, an…

Read Paper →
Computer Science Preprint PDF DOI

KOCO-BENCH: Can Large Language Models Leverage Domain Knowledge in Software Development?

Xue Jiang, Ge Li, Jiaru Qian, Xianjie Shi, Chenjie Li, Hao Zhu, Ziyu Wang, Jielun Zhang, Zheyu Zhao, Lingwei Wu, Kechi Zhang, Jia Li, Wenpin Jiao, Zhi Jin, Yihong Dong · 2026

Large language models (LLMs) excel at general programming but struggle with domain-specific software development, necessitating domain specialization methods for LLMs to learn and utilize domain knowl…

Read Paper →
Computer Science Preprint PDF DOI

Multiset Deletion-Correcting Codes: Bounds and Constructions

Avraham Kreindel, Isaac Barouch Essayag, Aryeh Lev Zabokritskiy (Yohananov) · 2026

We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet, motivated by permutation channels in which ordering is completely lost and errors act …

Read Paper →
Computer Science Preprint PDF DOI

Developing and Evaluating Lightweight Cryptographic Algorithms for Secure Embedded Systems in IoT Devices

Brahim Khalil Sedraoui, Abdelmadjid Benmachiche, Amina Makhlouf · 2026

The high rate of development of Internet of Things (IoT) devices has brought to attention new challenges in the area of data security, especially within the resource-limited realm of RFID tags, sensor…

Read Paper →
Computer Science Preprint PDF DOI

The Topology of Hardship: Empirical Curriculum Graphs and Structural Bottlenecks in Engineering Degrees

H. R. Paz · 2025

Engineering degrees are often perceived as "hard", yet this hardness is usually discussed in terms of content difficulty or student weaknesses rather than as a structural property of the curriculum it…

Read Paper →
Computer Science Preprint PDF DOI

A 0.32 mm$^2$ 100 Mb/s 223 mW ASIC in 22FDX for Joint Jammer Mitigation, Channel Estimation, and SIMO Data Detection

Jonas Elmiger, Fabian Stuber, Oscar Castaneda, Gian Marti, Christoph Studer · 2025

We present the first single-input multiple-output (SIMO) receiver ASIC that jointly performs jammer mitigation, channel estimation, and data detection. The ASIC implements a recent algorithm called si…

Read Paper →
Computer Science Preprint PDF DOI

Indefiniteness makes lattice reduction easier

Antoine Joux (CISPA, IMJ-PRG) · 2025

Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a …

Read Paper →
Computer Science Preprint PDF DOI

Channel-Robust RFF for Low-Latency 5G Device Identification in SIMO Scenarios

Yingjie Sun, Guyue Li, Hongfu Chou, Aiqun Hu · 2025

Ultra-low latency, the hallmark of fifth-generation mobile communications (5G), imposes exacting timing demands on identification as well. Current cryptographic solutions introduce additional computat…

Read Paper →
Computer Science Preprint PDF DOI

Neural Beamforming with Doppler-Aware Sparse Attention for High Mobility Environments

Cemil Vahapoglu, Timothy J. O'Shea, Wan Liu, Sennur Ulukus · 2025

Beamforming has significance for enhancing spectral efficiency and mitigating interference in multi-antenna wireless systems, facilitating spatial multiplexing and diversity in dense and high mobility…

Read Paper →
Computer Science Preprint PDF DOI

Complexity of counting points on curves and the factor $P_1(T)$ of the zeta function of surfaces

Diptajit Roy, Nitin Saxena, Madhavan Venkatesh · 2025

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known…

Read Paper →
Computer Science Preprint PDF DOI

Do Employee Verification Mechanisms Alter Cultural Signals in Employer Reviews?

Vladimir Martirosyan, Rachit Kamdar · 2025

Online reviews shape impressions across products and workplaces. Employer reviews combine narratives and ratings that reflect culture. Glassdoor permits fully anonymous posts; Blind requires employmen…

Read Paper →
Computer Science Preprint PDF DOI

Most Juntas Saturate the Hardcore Lemma

Vinayak M. Kumar · 2025

Consider a function that is mildly hard for size-$s$ circuits. For sufficiently large $s$, Impagliazzo's hardcore lemma guarantees a constant-density subset of inputs on which the same function is ext…

Read Paper →
Page 1 of 16 Next →