A binary code with the same weight distribution as its dual code is called formally self-dual (f.s.d.). We only consider f.s.d. even codes (codes with only even weight codewords). We show that any formally self-dual even binary code C of length n not divisible by 8 is balanced. We show that the weight distribution of a balanced near-extremal f.s.d. even code of length a multiple of 8 is unique....

This paper introduces an approach to support different phases of the Even Swaps process by Preference Programming, which is a framework for modeling incomplete information within multiattribute value theory. In the approach, the Even Swaps process is carried out as usual, but in parallel the preferences of the decision maker are modeled with a Preference Programming model, which is also updated...

We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all th...

the academic center of jundishapur has been among significant ones in the old east. an important issue in recognizing such a center is studying the factors relative to its academic growth, among which the following can be enumerated: the emigration of christian scientists, the sassanid king’s attention to the city, etc. the important matter, however, is the consistency of this center in academi...