Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Rentonn - Airbnb clone 1.0
VisualNEO for Windows 18.08.31.0
SentiVeillance SDK Trial 7.0.191272
dbForge SQL Complete 6.1
Uber for E-Scooters 1.0
ODBC Driver for MySQL 2.4
dbForge Schema Compare for MySQL 4.4
dbForge Studio for MySQL 8.1
dbForge Query Builder for MySQL 4.4
dbForge Data Compare for MySQL 5.5
Aqua Data Studio 19.5
ConyEdit for Windows 1.1.1
GetOrgChart 2.5.3.0
Database Workbench Pro 5.6.0
.Net VCL for Delphi 1.0.0.0
Top Code
MCU 8051 IDE 1.4.7
C/C++ GRAPHICAL LIBRARY NE 1.0
Faculty Evaluation System 1.1
jClientUpload 1.0
heap sort
Azizi search engine script PHP 4.1.10
Simulation of MUSIC (DOA ESTIMATION) - GUI 1.0
PHP Product Order Form 1.0
PHP MLM Software 2.0.1
MLM Binary Plan Script – i-Netsolution 1.0.2
Restaurant Table Booking System 2.0
Cuckoo Optimization Algorithm 1.0
Ant Colony Optimization (ACO) 1.0
deploypcode - recursively pcode files with help attached 1.0
C/C++ Coding Standards Analysis 1.0
Top Rated
Paste phpSoftPro 1.4.1
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
Extended (n,k)-gray code 1.0
File ID: 79375






Extended (n,k)-gray code 1.0
Download Extended (n,k)-gray code 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 29
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: 29



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!*(n-k)!) (binomial coefficient)
ind is nv-by-k 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 N-tier 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
- required fields
     

Please enter text on the image