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.
The PWE (Partial Weight Enumerator) algorithm permits to obtain a partial weights enumerator for linear codes. This algorithm is based on the Multiple Impulse Method combined with a Monte Carlo Method. The main disadvantage of this algorithm is the height run time complexity when the set of selected codewords as sample is large. However, when this set is reduced it becomes not representative and the...
This paper investigates the construction and iterative threshold decoding of low rate Quasi-Cyclic One Step Majority logic codes based on combinatorial designs. These codes are constructed with two type of difference family: cyclic disjoint difference sets and cyclic disjoint difference family. They can be encoded with low complexity, and perform very well when decoded with the Iterative threshold...
In this paper we present a genetic algorithm to design good linear codes with large minimum weight and small dual minimum distance. These two metrics are evaluated by the Multiple Impulse Method (MIM). The existence of some codewords of small weights in the dual of the code designed by our genetic algorithm yield to good performances in terms of the Bit Error Rate (BER) when a decoder based on majority...
Finding the minimum distance of linear codes is in general a NP-hard problem, we propose an efficient algorithm to attack this problem. The principle of this approach is to search code words locally around the all-zero code word perturbed by a level of noise magnitude, in other words the maximum of noise that can be corrected by a Soft-In decoder, anticipating that the resultant nearest non-zero code...
Brilliant green was used as a complexing agent in cloud point extraction (CPE) and applied for selective preconcentration of trace amounts of gold in geological matrices. The analyte in the initial aqueous solution was acidified with hydrochloric acid (0.1 M) and octylphenoxypolyethoxyethanol (Triton X-114) was added as a surfactant. After phase separation, based on the cloud point separation of the...
Brilliant green was used as a complexing agent in cloud point extraction (CPE) and applied for selective preconcentration of trace amounts of gold in geological matrices. The analyte in the initial aqueous solution was acidified with hydrochloric acid (0.1 M) and octylphenoxypolyethoxyethanol (Triton X-114) was added as a surfactant. After phase separation, based on the cloud point separation of the...
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.