English
Related papers

Related papers: Multidimensional Flash Codes

200 papers

An erasure code is said to be a code with sequential recovery with parameters $r$ and $t$, if for any $s \leq t$ erased code symbols, there is an $s$-step recovery process in which at each step we recover exactly one erased code symbol by…

Information Theory · Computer Science 2018-01-23 Balaji Srinivasan Babu , Ganesh R. Kini , P. Vijay Kumar

We consider the rack-aware storage system where \(n\) nodes are organized in \(\bar{n}\) racks each containing \(u\) nodes, and any \(k\) nodes can retrieve the stored file. Moreover, any single node erasure can be recovered by downloading…

Information Theory · Computer Science 2021-01-22 Zhifang Zhang , Liyang Zhou

The strong demand for quantum memory, a key building block of quantum network, has inspired new methodologies and led to experimental progress for quantum storage. The use of quantum memory for spatial multimode or image storage could…

Quantum Physics · Physics 2015-06-05 Dong-Sheng Ding , Jing-Hui Wu , Zhi-Yuan Zhou , Bao-Sen Shi , Xu-Bo Zou , Guang-Can Guo

A model is presented for the quantum memory, the content of which is a pure quantum state. In this model, the fundamental operations of writing on, reading, and resetting the memory are performed through scattering from the memory. The…

Quantum Physics · Physics 2007-05-23 Tai Tsun Wu , Ming Lun Yu

The enormous amount of data to be represented using large graphs exceeds in some cases the resources of a conventional computer. Edges in particular can take up a considerable amount of memory as compared to the number of nodes. However,…

Artificial Intelligence · Computer Science 2023-12-18 Faisal N. Abu-Khzam , Rana H. Mouawi , Amer Hajj Ahmad , Sergio Thoumi

Peer-to-peer distributed storage systems provide reliable access to data through redundancy spread over nodes across the Internet. A key goal is to minimize the amount of bandwidth used to maintain that redundancy. Storing a file using an…

Information Theory · Computer Science 2007-07-13 Alexandros G. Dimakis , P. Brighten Godfrey , Martin J. Wainwright , Kannan Ramchandran

A self-correcting quantum memory is a type of quantum error correcting code that can correct errors passively through cooling. A major open question in the field is whether self-correcting quantum memories can exist in 3D. In this work, we…

Quantum Physics · Physics 2024-11-06 Ting-Chun Lin , Hsin-Po Wang , Min-Hsiu Hsieh

Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory…

Information Theory · Computer Science 2018-05-10 ChenYang Xia , YouZhe Fan , Ji Chen , Chi-Ying Tsui

To explore what features of multi-dimensional training can be remembered in granular materials, the response of a small, two-dimensional packing of hydrogel spheres to two independent types of shear is measured. Packings are trained via the…

Soft Condensed Matter · Physics 2024-07-23 Chloe W. Lindeman

Efficient quantum memories will be an essential building block of large scale networked quantum systems and provide a link between flying photonic qubits and atomic or quasi-atomic local quantum processors. To provide a path to scalability…

Intrinsic charge trap capacitive non-volatile flash memories take a significant share of the semiconductor electronics market today. It is a challenge to create intrinsic traps in the dielectric layer without high temperature processing…

Applied Physics · Physics 2019-06-19 Sandip Mondal , V Venkataraman

Long-distance quantum communication through optical fibers is currently limited to a few hundreds of kilometres due to fiber losses. Quantum repeaters could extend this limit to continental distances. Most approaches to quantum repeaters…

We investigate the usage of highly efficient error correcting codes of multilevel systems to protect encoded quantum information from erasure errors and implementation to repetitively correct these errors. Our scheme makes use of quantum…

Quantum Physics · Physics 2017-01-23 Sreraman Muralidharan , Chang-Ling Zou , Linshu Li , Jianming Wen , Liang Jiang

Future quantum photonic networks require coherent optical memories for synchronizing quantum sources and gates of probabilistic nature. We demonstrate a fast ladder memory (FLAME) mapping the optical field onto the superposition between…

Quantum Physics · Physics 2018-06-07 Ran Finkelstein , Eilon Poem , Ohad Michel , Ohr Lahad , Ofer Firstenberg

We suggest a method for holding a dictionary data structure, which maps keys to values, in the spirit of Bloom Filters. The space requirements of the dictionary we suggest are much smaller than those of a hashtable. We allow storing n keys,…

Data Structures and Algorithms · Computer Science 2008-04-14 Ely Porat

A functional $k$-batch code of dimension $s$ consists of $n$ servers storing linear combinations of $s$ linearly independent information bits. These codes are designed to recover any multiset of $k$ requests, each being a linear combination…

Information Theory · Computer Science 2025-01-23 Lev Yohananov , Isaac Barouch Essayag

Mapping neuro-inspired algorithms to sensor backplanes of on-chip hardware require shifting the signal processing from digital to the analog domain, demanding memory technologies beyond conventional CMOS binary storage units. Using…

Emerging Technologies · Computer Science 2018-03-15 Aidana Irmanova , Alex Pappachen James

In recent years, due to the spread of multi-level non-volatile memories (NVM), $q$-ary write-once memories (WOM) codes have been extensively studied. By using WOM codes, it is possible to rewrite NVMs $t$ times before erasing the cells. The…

Information Theory · Computer Science 2016-05-18 Evyatar Hemo , Yuval Cassuto

Racetrack memory is a new technology which utilizes magnetic domains along a nanoscopic wire in order to obtain extremely high storage density. In racetrack memory, each magnetic domain can store a single bit of information, which can be…

Information Theory · Computer Science 2017-01-25 Yeow Meng Chee , Han Mao Kiah , Alexander Vardy , Van Khu Vu , Eitan Yaakobi

A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different…

Information Theory · Computer Science 2020-01-06 Hao Chen , Xianmang He , Jian Weng , Liqing Xu
‹ Prev 1 8 9 10 Next ›