
Extended (n,k)gray code 1.0 File ID: 79375 


 Extended (n,k)gray code 1.0 License: Freeware File Size: 10.0 KB Downloads: 31
Submit Rating: 



Extended (n,k)gray code 1.0 Description 

Description: Our basic idea is based on (n,k)gray code which was introduced in one paper named :"Generalized Gray Codes with Applications".
Our extention is allowing each digit ranged from different digit which is widely useful in some situations.For example, (3,2)Gray code is (0,0), (0,1), (0,2),(1,2),(1,0),(1,1),(2,1),(2,2),(2,0). The parameter 3 is the range of each digit {0,1,2}, and 2 restricts there are 2 digits. Our extended gray code is working in this way. For example, if we want to generate gray code with the range of {2 3 3 4} for each digit as input parameter, our function will produce: 0000,1000,1100,0100,0200,1200,1210,0210,........ in total of 72 sequences.
Please start from 'ControlCenter.m', we give an example there with detailed explanation. I also add mex programming function for fast generation, good for advance users.Pay attention, i have only tested it under linux. If there is any question, please let me know, I will answer you questions within one day if internet is available.
License: Freeware Related: add mex, advance userspay, allowing, sequences, gray code, 02121011212220 the, controlcenterm, Add, an example, Based, basic idea, Input, applicationsquot, Answer, question, 012 and, way for example, introduced O/S:BSD, Linux, Solaris, Mac OS X File Size: 10.0 KB Downloads: 31


More Similar Code 

Will produce a figure of an n bit Gray Code shaft encoder and a gray code table Straightforward program. Gray code is produced by recursion and the disk is drawn using patch objects
Please refer to: http://en.wikipedia.org/wiki/Gray_code
The reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only one digit.
The reflected...
http://simulations.narod.ru/ Using: ind=all_combinations(n,k) Number of all posible variants is nv=C(n,k)=n!/(k!*(nk)!) (binomial coefficient) ind is nvbyk matrix. Example, 2 indexes from 1 2 3: all_combinations(3,2)
ICHOOSE(N,K) gives all combinations of choosing K indices from the set 1:N without order and without repetitions.
EXAMPLE: ind = ichoose(4,2); v = 'ABCD'; v(ind) % ['AB';'AC';'AD';'BC';'BD';'CD']
ICHOOSE...
MAT = NPERMUTEK(N,K) returns all possible permutations of the elements taken from vector N of length K. This type of sampling is an ordered sample with replacement. This is also known as the permutations with repetition. MAT has size...
chi2test(data, numOfInterval) data: input random number numOfInterval: number of interval require: n/k >= 5 k >= 100
NMULTICHOOSEK(N,K) finds the number of multisets of length k on n symbols. NMULTICHOOSEK can take vector or scalar input.
NMULTICHOOSEK(N,K,'single') is the same as NCHOOSEK (unordered samples WITHOUT repetition), except that it accepts...
Uses a recursion relation to generate all the binomial coefficients nchoosek(n,k) for a range n<=nmax, k<= n. This is much faster than using nchoosek to make this table.
The idea of this function is to be used when you have to...
A = RANDSUBSET(N, K) is equivalent to
ALLSUBSETS = NCHOOSEK(1:N,K); A = ALLSUBSETS(RANDI(NCHOOSEK(N,K)));
% or
A = RANDPERM(N); A = SORT(A(1:k));
This function can also be used to generate...
KodeFu is an Ntier entity code generator that copies object definitions from a .NET assembly and generates equivalent source code for the objects, translator classes, and a suite of unit tests for said translators. 
User Review for Extended (n,k)gray code 
