Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Approximate computation of the weight function of a linear binary code

descriptionPublicationkeyboard_double_arrow_right Article Publisher:Russian Academy of Sciences - RAS (Rossiĭskaya Akademiya Nauk - RAN), Siberian Branch (Sibirskoe Otdelenie), Sobolev Insitute of Mathematics (Institut Matematiki Im. S. L. Soboleva), Novosibirsk
Authors: Vyalyj, M. N.;

Approximate computation of the weight function of a linear binary code

Abstract

The problem of approximate computation of the weight function of a linear binary code in the unit circle with an additive error \(\varepsilon\) is investigated. The main result reads: To calculate all coefficients of the weight function of a linear binary code it is sufficient to find an approximate computation of the weight function with an additive error equal to \(2^{n-n^c}\) for some positive constant \(c<1\).

Keywords

Other types of codes, weight function of a linear code, approximate computation, linear code, Approximation methods and heuristics in mathematical programming

Powered by OpenAIRE graph
Found an issue? Give us feedback