Results 241 to 250 of about 2,148,225 (286)

Maximal avoidable sets of words(Algebraic Theory of Codes and Related Topics)

open access: yesMaximal avoidable sets of words(Algebraic Theory of Codes and Related Topics)
openaire  

An Application of Set Theory to Coding Theory

open access: closedMathematics Magazine, 1989
"As high-speed electronic communication becomes commonplace, there is a tremendous need for better transmission schemes-ones that minimize the effect of inevitable transmission errors, ones that protect confidential or secret messages, ones that route messages most efficiently.
Noca Alon, Andy Liu
  +4 more sources

Finding maximum independent sets in graphs arising from coding theory

open access: closedProceedings of the 2002 ACM symposium on Applied computing, 2002
New results are presented concerning binary correcting codes, such as deletion-correcting codes, transposition-correction codes, and codes for the Z-channel. These codes are important due to the possibility of packet loss and corruption on internet transmissions.
Sergiy Butenko   +4 more
  +4 more sources

Unknown Malicious Codes Detection Based on Rough Set Theory and Support Vector Machine

open access: closedThe 2006 IEEE International Joint Conference on Neural Network Proceedings, 2006
For detecting malicious codes, a classification method of support vector machine (SVM) based on rough set theory (RST) is proposed. The original sample data is preprocessed with the knowledge reduction algorithm of RST, and the redundant features and conflicting samples are eliminated from the working sample dataset to reduce space dimension of sample ...
null Boyun Zhang   +4 more
  +4 more sources

Application of coding theory to the construction of the Singer difference sets†

open access: closedInternational Journal of Control, 1973
In this paper we give a new and simple construction for the cyclic [(q m − 1)/(q − 1), q m−1, q m−2(q− 1)]—difference sets (q = p γ is a prime power) using the methods of coding theory. The construction is such that, in the case q = 2, the 2-ranks of both the incidence matrix and its complementary matrix are easily determined.
HARRY T. HSU, JOHN E. OLSON
openaire   +2 more sources

Probabilistic approach to attributes coding in the rough sets theory

open access: closedProceedings ICCI `92: Fourth International Conference on Computing and Information, 2003
Objects in an information system analyzed by the rough sets theory methods are characterized by attributes, which can take on a finite set of values only. In diagnostic experiments, condition attributes are usually treated as continuous variables, taking values from certain intervals.
A. Lenarcik, Z. Piasta, M. Masternak
openaire   +2 more sources

Toward a Source Coding Theory for Sets

open access: closedData Compression Conference (DCC'06), 2006
The problem of communicating (unordered) sets, rather than (ordered) sequences is formulated. Elementary results in all major branches of source coding theory, including lossless coding, high-rate and low-rate quantization, and rate distortion theory are presented. In certain scenarios, rate savings of log n!
L.R. Varshney, V.K. Goyal
openaire   +2 more sources

New Malicious Code Detection Based on N-Gram Analysis and Rough Set Theory

open access: closed, 2007
Motivated by the standard signature-based technique for detecting viruses, we explore the idea of automatically detecting malicious code using the N-gram analysis. The method is based on statistical learning and not strictly dependent on certain viruses. We propose the use of rough set theory (RST) to reduce the feature dimension.
Boyun Zhang   +4 more
openaire   +2 more sources

Sparse coding and rough set theory-based hybrid approach to the classificatory decomposition of cortical evoked potentials

open access: closedProceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02., 2002
This paper presents a novel approach to classification of decomposed cortical evoked potentials (EPs). The decomposition is based on learning of a sparse set of basis functions using an artificial neural network (ANN). The basis functions are generated according to a probabilistic model of the data.
G.M. Boratyn   +3 more
openaire   +2 more sources

Classification of the odd sets in $$\hbox {PG}(4,4)$$ PG ( 4 , 4 ) and its application to coding theory

open access: closedApplicable Algebra in Engineering, Communication and Computing, 2013
A set $${\fancyscript{K}}$$ in $$\hbox {PG}(r,4), r \ge 2$$ ,
Taichiro Tanaka, Tatsuya Maruta
openaire   +2 more sources

Home - About - Disclaimer - Privacy