The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Based on cyclic simplex codes, a new construction of a family of two-weight codes is given. These two-weight codes are in a simple 2-generator quasi-cyclic form. Based on this construction, new optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208, 6, 135], [221, 6, 144] codes are thus obtained. It is also shown that some codes that meet...
Pattern recognition systems based on compressed patterns and compressed sensor measurements can be designed using low-density matrices. We examine truncation encoding where a subset of the patterns and measurements are stored perfrectly while the rest is discarded. We also examine the use of LDPC parity check matrices for compressing measurements and patterns. We show how more general ensembles of...
In this paper, a construction of a pair of quasi-cyclic LDPC codes to construct a quantum error-correcting code is proposed. Our construction method is based on algebraic combinatorics and have lots of variations for length, code rate.
Upper bounds of minimum distance distributions of Gallger codes and irregular LDPC codes were derived by Gallage and Di, respectively. Di's bounds are tight for irregular LDPC codes which have variable nodes of degree two, however, it is not tight for irregular LDPC codes which do not. In this paper, we derive tight lower and upper bounds of minimum distance distributions of irregular LDPC code ensembles...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.