English
Related papers

Related papers: Augmented space recursion code and application in …

200 papers

A code is locally recoverable when each symbol in one of its code words can be reconstructed as a function of $r$ other symbols. We use bundles of projective spaces over a line to construct locally recoverable codes with availability; that…

We propose a refined scaling law to predict the finite-length performance in the waterfall region of spatially coupled low-density parity-check codes over the binary erasure channel. In particular, we introduce some improvements to the…

Information Theory · Computer Science 2020-08-26 Roman Sokolovskii , Fredrik Brännström , Alexandre Graell i Amat

We present a novel algorithm which can overcome the drawbacks of the conventional linear scaling method with minimal computational overhead. This is achieved by introducing additional constraints, thus eliminating the redundancy of the…

Materials Science · Physics 2015-06-25 Eiji Tsuchida

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…

Information Theory · Computer Science 2007-07-13 M. Twitto , I. Sason , S. Shamai

Following the approach of Yu, Singh, and Krakauer [Phys. Rev. B 43 (1991) 6411] we extended the linearized augmented plane wave code WIEN of Blaha, Schwarz, and coworkers by the evaluation of forces. In this paper we describe the approach,…

We present a method for electronic structure calculations that retains all of the advantages of real space and addresses the inherent inefficiency of a regular grid, which has equal precision everywhere. The computations are carried out on…

Condensed Matter · Physics 2009-10-28 Gil Zumbach , N. A. Modine , Efthimios Kaxiras

The subspace design property for additive codes is a higher-dimensional generalization of the minimum distance property. As shown recently by Brakensiek, Chen, Dhar and Zhang, it implies that the code has similar performance as random…

Information Theory · Computer Science 2026-04-17 Rohan Goyal , Venkatesan Guruswami , Jun-Ting Hsieh

I consider techniques for Berger-Oliger adaptive mesh refinement (AMR) when numerically solving partial differential equations with wave-like solutions, using characteristic (double-null) grids. Such AMR algorithms are naturally recursive,…

General Relativity and Quantum Cosmology · Physics 2015-03-13 Jonathan Thornburg

This paper presents a flexible irregular model for heterogeneous cloud storage systems and investigates how the cost of repairing failed nodes can be minimized. The fractional repetition code, originally designed for minimizing repair…

Information Theory · Computer Science 2016-11-18 Quan Yu , Chi Wan Sung , Terence H. Chan

The use of adaptive mesh refinement (AMR) techniques is crucial for accurate and efficient simulation of higher dimensional spacetimes. In this work we develop an adaptive algorithm tailored to the integration of finite difference…

General Relativity and Quantum Cosmology · Physics 2009-11-10 Frans Pretorius , Luis Lehner

Tensor networks implementing quantum error correcting codes have recently been used to construct toy models of holographic duality explicitly realizing some of the more puzzling features of the AdS/CFT correspondence. These models reproduce…

High Energy Physics - Theory · Physics 2016-03-23 Zhao Yang , Patrick Hayden , Xiao-Liang Qi

We present a genetic algorithm for the atomistic design and global optimisation of substitutionally disordered bulk materials and surfaces. Premature convergence which hamper conventional genetic algorithms due to problems with…

Materials Science · Physics 2008-09-10 Chris E. Mohn , Walter Kob

Motivated by applications in DNA-based storage, we study explicit encoding and decoding schemes of binary strings satisfying locally balanced constraints, where the $(\ell,\delta)$-locally balanced constraint requires that the weight of any…

Information Theory · Computer Science 2022-01-31 Chen Wang , Ziyang Lu , Zhaojun Lan , Gennian Ge , Yiwei Zhang

To make the investigation of electronic structure of incommensurate heterostructures computationally tractable, effective alternatives to Bloch theory must be developed. In Massatt2017, we developed and analyzed a real space scheme that…

Mathematical Physics · Physics 2017-08-09 Daniel Massatt , Stephen Carr , Mitchell Luskin , Christoph Ortner

A method to combine two quantum error-correcting codes is presented. Even when starting with additive codes, the resulting code might be non-additive. Furthermore, the notion of the erasure space is introduced which gives a full…

Quantum Physics · Physics 2007-05-23 Markus Grassl , Thomas Beth

Adaptive finite element methods are a powerful tool to obtain numerical simulation results in a reasonable time. Due to complex chemical and mechanical couplings in lithium-ion batteries, numerical simulations are very helpful to…

Numerical Analysis · Mathematics 2024-04-17 Raphael Schoof , Lennart Flür , Florian Tuschner , Willy Dörfler

In this paper, we propose an extended plane wave framework to make the electronic structure calculations of the twisted bilayer 2D material systems practically feasible. Based on the foundation in [Y. Zhou, H. Chen, A. Zhou, J. Comput.…

Computational Physics · Physics 2023-01-05 Xiaoying Dai , Aihui Zhou , Yuzhi Zhou

This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error…

Information Theory · Computer Science 2007-07-13 Igal Sason , Idan Goldenberg

The modeling of solute chemistry at low-symmetry defects in materials is historically challenging, due to the computation cost required to evaluate thermodynamic properties from first principles. Here, we offer a hybrid multiscale approach…

Materials Science · Physics 2025-06-12 Nutth Tuchinda , Changle Li , Christopher A. Schuh

We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…