Results 281 to 290 of about 163,262 (305)

Relating code equivalence to other isomorphism problems

Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huck Bennett, Kaung Myat Htay Win
openaire   +3 more sources

Determining the Equivalence of Algebraic Expressions by Hash Coding

Journal of the ACM, 1971
In algebraic manipulation one often wants to know if two expressions are equivalent under the algebraic and trigonometric identities. One way to check this is to substitute a random value for each variable in the expressions and then see if both expressions evaluate to the same result.
openaire   +1 more source

Code Equivalence and Group Isomorphism

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
László Babai, Paolo Codenotti, Joshua A. Grochow, Youming Qiao   +3 more
openaire   +1 more source

Three Equivalent Codes for Autosegmental Representations.

2016
A string encoding for a subclass of bipartite graphs enables graph rewriting used in autosegmental descriptions of tone phonology via existing and highly optimized finite- state transducer toolkits (Yli-Jyrä 2013). The current work offers a rigorous treatment of this code-theoretic approach, generalizing the methodology to all bipartite graphs having ...
openaire   +2 more sources

Binary Huffman equivalent codes with a short synchronizing codeword

IEEE Transactions on Information Theory, 1998
S Perkins
exaly  

Linear Codes Over $\mathbb F_q$ Are Equivalent to LCD Codes for $q>3$

IEEE Transactions on Information Theory, 2018
Claude Carlet, Sihem Mesnager, Chunming Tang   +2 more
exaly  

The symmetry of HK codes representing close-packed structures and the efficient generation of non-equivalent polytypes of a given length

Acta Crystallographica Section A: Foundations and Advances, 2008
Estevez-Rams E
exaly  

Equivalence of punctured convolutional codes from shift equivalent puncturing patterns

2004
Xiangyang Luo
exaly  

On equivalence of two tests for codes

2008
Summary: Our goal is to show the equivalence between two algorithms concerning uniquely decipherable codes. We show an automaton that solves this problem, and we define remainders for the states of automaton. Finally we show that remainders compose the sets of the algorithm of Sardinas-Patterson.
openaire   +1 more source

Self-Synchronization Strings in Huffman Equivalent Codes

2006
Lei Cao
exaly