Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Block code”

Surface code implementation of block code state distillation

Austin G. Fowler, Simon J. Devitt, Cody Jones · Scientific Reports · 2013

State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states produced a single improved [formula: see text] state given 15 input copies. New block code state distillation methods can produce k improved [formula: see text] states given 3k + 8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three.

Cited by 97Open access

Surface code implementation of block code state distillation

Fowler, Austin G., Devitt, Simon J., Jones, Cody · arXiv (Cornell University) · 2013

State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states |A>=(|0>+e^{iπ/4}|1>)/\sqrt{2} produced a single improved |A> state given 15 input copies. New block code state distillation methods can produce k improved |A> states given 3k+8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three.

Cited by 0Open access

Code for micromorhology block manuscript

Fagernäs, Zandra · Leiden Repository (Leiden University) · 2025

The integration of biomolecular studies of past organisms with geoarchaeological studies can significantly improve our understanding of the relative chronology and context of archaeologically (in)visible behaviors. However, the complexity and sedimentological heterogeneity of archaeological deposits at a microscopic scale is often not taken into consideration in biomolecular studies. Here, we investigate the preservation and retrieval of paleoproteomic data from bone fragments embedded in Pleistocene resin-impregnated sediment blocks. We show that resin impregnation has minimal effect on skeletal protein taxonomic identifications in modern skeletal material but observe an increase in oxidation of methionines. We then successfully retrieve proteins from resin-impregnated blocks from the Paleolithic sites of Bacho Kiro Cave, La Ferrassie, and Quinçay. The taxonomic identifications of minute bones encased in resin are in line with previous analyses of the faunal communities of these sites, with a diversity of taxa (Bos sp./Bison sp., Equus sp., Ursus sp., and Caprinae) observed at a microscale in Bacho Kiro. This differs from results from La Ferrassie where most of the samples are identified as a single taxon (Bos sp./Bison sp.) across different areas of the site. The block from Quinçay only provided taxonomic identification of two out of eleven bone-derived samples, likely due to diagenesis. Our work indicates that paleoproteomes can be retrieved from bone fragments at a microstratigraphic resolution, enabling the detailed study of faunal community composition at a scale that more closely matches that of past human occupations.<br>

Cited by 0Open access

Block sweeping methods (source code)

A. А. Nikitin · Figshare · 2017

This is a library of algorithms for the eikonal equation solution. It includes implementations of proposed parallel block sweeping methods [1] optimized for multicore CPUs. These methods are based on the fast sweeping method (FSM) [2] and the locking sweeping method (LSM) [3] numerical algorithms. Proposed methods achieve high parallel efficiency due to optimization of task synchronization and CPU cache use. The library also includes implementations of FSM and LSM as well as another parallel algorithm DFSM presented in [4]. For more information see conference abstract [1], we have also submitted an extended article for review and publication and are hoping to publish it in 2017. We are planning to improve this library in the future, for latest versions go to https://github.com/aanikitin/seis-eikonal. References: 1) Nikitin Alexandr A., Serdyukov Alexandr S., Duchkov Anton A. Optimization of parallel sweeping methods of numerical computation of seismic wave travel times for shared memory computing systems // ИНТЕРЭКСПО ГЕО-СИБИРЬ. – 2016. – V. 2. – N. 1. – P. 241-245. 2) Zhao, H.: A fast sweeping method for eikonal equations. Mathematics of computation 74(250), 603-627 (2005) 3) Bak, S., McLaughlin, J., Renzi, D.: Some improvements for the fast sweeping method. SIAM Journal on Scientific Computing 32(5), 2853-2874 (2010) 4) Detrixhe, M., Gibou, F., Min, C.: A parallel fast sweeping method for the eikonal equation. Journal of Computational Physics 237, 46-55 (2013)

Cited by 1Open access

Block code on L-algebras

M. Mohseni Takallo · Journal of algebraic hyperstructures and logical algebras · 2023

By using the notion of L-algebras as an important part of the ordered algebra, we introduce the notions of block code, x-function and x-subsets on an arbitrary L-algebra. Then some related properties and examples are provided. Also, by using these notions, we define an equivalence relation on L-algebra and we introduce a new order on the generated code based on L-algebras. Finally, we will provide a method which allows us to find an L-algebra starting from a given arbitrary binary block code.

Cited by 0Open access

Block Layered Space-Time Code Design

Monika Agrawal, T. Pangti · 2006

This DOI is not currently attached to any metadata records. DOIs can’t actually ever be deleted (they’re persistent), but sometimes our members create DOIs in error. We do have a process to approximate deletion which we follow only in rare cases where the DOI has been genuinely created in error, and most crucially, if the DOI has never been published anywhere online or in print and never otherwise distributed to or communicated with anyone (authors, readers, reviewers, etc.

Cited by 0Open access

Cipher Block Chaining Message Authentication Code

2007

1.0 29-Oct-2007 Derived from Security Target, no changes 1.1 07-Nov-2007 Updated Reference to new Version of AES User Guidance 1.2 07-Dec-2007 Added P5CD012V0B as new supported hardware configuration Contact information

Cited by 0

Blind Frame Synchronisation For Block Code

Sébastien Houcke, Guillaume Sicot · HAL (Le Centre pour la Communication Scientifique Directe) · 2006

Publication in the conference proceedings of EUSIPCO, Florence, Italy, 2006

Cited by 7Open access

Weighted decoding of linear block code

Fang, Juing, Ecole Nationale Superieure des Telecommunications (ENST), 75 - Paris (France) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1986

Cited by 0

Closed loop space-time block code

Xiaofeng Tao, Haas Harald, Zhuizhuan Yu et al. · 2002

In 3GPP FDD specifications, space time transmit diversity (STTD) employs space-time block code (STBC) to maintain orthogonality between the two antennas in order to avoid self-interference in fading channels. However, the STTD technique is just open loop transmit diversity, and we investigate whether we can obtain further gain if closed loop STBC is used. A novel scheme based on closed loop STBC is proposed first. And then an optimized allocation scheme of a fixed transmitter power budget between two transmit antennas is presented. Finally, COSSAP simulation results show a significant performance improvement between closed loop STBC and traditional STBC. Moreover, these simulation results also show a good agreement with our theoretical analyses.

Cited by 12

Quasi-Orthogonal Space-Time Block Code

Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung · Communications and signal processing · 2007

Overview of Quasi-Orthogonal STBC (QO-STBC) Fundamentals of QO-STBC QO-STBC with Minimum Decoding Complexity (MDC-QOSTBC) Differential QO-STBC Rates, Complexity, and Diversity Tradeoff in QO-STBC More on QO-STBC.

Cited by 67

Code multiplexing using linear block codes

A V Rabin, Steven Rabin, Arseniy Zyulkov · EPJ Web of Conferences · 2025

This paper explores the application of code multiplexing using linear block codes in communication systems. Through a comprehensive analysis of contemporary literature on switching methods and signal modeling, the study investigates the principles of code channel division switching. The research proposes novel approaches for synthesizing orthogonal encoding and decoding matrices, enabling efficient channel division through simplified schemes. The study focuses on the implementation of code division multiplexing using block codes, highlighting its potential for enhancing communication efficiency. Additionally, the paper discusses the dual benefit of this approach, noting its capacity for simultaneous error correction during the channel division process. This feature underscores the method's potential for improving both the reliability and efficiency of data transmission in various communication systems

Cited by 1Open access

R code for block-forward method.

Ana Martins (187412), Manuel Scotto (11105194), Ricardo Deus (11105197) et al. · Figshare · 2021

&lt;p&gt;This file provides the code for using the block-forward method within the &lt;i&gt;tscount&lt;/i&gt; package in R version 3.6.2.&lt;/p&gt; &lt;p&gt;(R)&lt;/p&gt;

Cited by 0Open access