Search results for "Covering"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Tao Feng 0010, Ju-Sheng Mi, Wei-Zhi Wu 0001	Covering-Based Generalized Rough Fuzzy Sets.	RSKT	2006	DBLP DOI BibTeX RDF	covering-based lower and upper approximations, reduction, covering, Rough fuzzy sets
74	Jun Hu 0002, Guoyin Wang 0001	Knowledge Reduction of Covering Approximation Space.	Trans. Comput. Sci.	2009	DBLP DOI BibTeX RDF	rough sets, reduction, Covering, granule
68	William Zhu 0001, Fei-Yue Wang 0001	On Three Types of Covering-Based Rough Sets.	IEEE Trans. Knowl. Data Eng.	2007	DBLP DOI BibTeX RDF	data mining, Rough sets, approximation, fuzzy sets, reduct, granular computing, covering, computing with words
67	Keyun Qin, Yan Gao, Zheng Pei 0001	On Covering Rough Sets.	RSKT	2007	DBLP DOI BibTeX RDF	covering rough set, covering lower approximation, covering upper approximation, representative element, Rough set
63	Mingwen Chen, Songlin Hu, Zhiyong Liu 0002	Covering-Based Routing Algorithms for Cyclic Content-Based P/S System.	FAW	2009	DBLP DOI BibTeX RDF	cyclic topology, covering-based routing, content-based routing, publish/subscribe system
60	Qinghua Zhang 0001, Guoyin Wang 0001, Jun Hu 0002, Hai-Tao Teng	Approximation Partition Spaces of Covering Space.	GrC	2007	DBLP DOI BibTeX RDF
57	Abderrazak Zahour, Bruno Taconet, Laurence Likforman-Sulem, Wafa Boussellaa	Overlapping and multi-touching text-line segmentation by Block Covering analysis.	Pattern Anal. Appl.	2009	DBLP DOI BibTeX RDF	Block covering, Text-line segmentation, Overlapping and multi-touching lines, Block Counting, Ancient Arabic documents
57	Dean S. Hoskins, Charles J. Colbourn, Douglas C. Montgomery	Software performance testing using covering arrays: efficient screening designs with categorical factors.	WOSP	2005	DBLP DOI BibTeX RDF	D-optimal designs, performance testing, covering arrays
57	Sosina Martirosyan, Tran van Trung	On t-Covering Arrays.	Des. Codes Cryptogr.	2004	DBLP DOI BibTeX RDF	t-covering arrays, perfect hash families, orthogonal arrays, algebraic-geometric codes
57	Rajiv Gandhi, Samir Khuller, Aravind Srinivasan	Approximation Algorithms for Partial Covering Problems.	ICALP	2001	DBLP DOI BibTeX RDF	Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
54	Paulo F. Flores, Horácio C. Neto, João P. Marques Silva	On Applying Set Covering Models to Test Set Compaction.	Great Lakes Symposium on VLSI	1999	DBLP DOI BibTeX RDF	Test Set Compaction, Unate Covering Problem, Test Pattern Generation, Set Covering
51	Yan Wang 0014, Jianguo Lu, Jessica Chen	Crawling Deep Web Using a New Set Covering Algorithm.	ADMA	2009	DBLP DOI BibTeX RDF	deep web crawling, greedy algorithm, set covering problem
51	Sandro Fouché, Myra B. Cohen, Adam A. Porter	Towards incremental adaptive covering arrays.	ESEC/SIGSOFT FSE	2007	DBLP DOI BibTeX RDF	fault localization, covering array
51	Selda Küçükçifçi, Charles C. Lindner	Minimum Covering for Hexagon Triple Systems.	Des. Codes Cryptogr.	2004	DBLP DOI BibTeX RDF	hexagon triple system, minimum covering, perfect
49	Achill Schürmann, Frank Vallentin	Computational Approaches to Lattice Packing and Covering Problems.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
49	Zehai Li, Jigui Sun, Jun Zhao, Haihong Yu	Transforming Non-covering Dimensions in OLAP.	APWeb	2005	DBLP DOI BibTeX RDF
48	B. K. Tripathy 0001, G. K. Panda	On Covering Based Approximations of Classifications of Sets.	IEA/AIE	2009	DBLP DOI BibTeX RDF	approximations of classifications, covering based rough sets and covering based approximations of classifications, Classifications, rough sets
48	Gerzson Kéri, Patric R. J. Östergård	Bounds for Covering Codes over Large Alphabets.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	covering code, q-ary code, surjective code, covering radius
48	Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.	Covering Radius 1985-1994.	Appl. Algebra Eng. Commun. Comput.	1997	DBLP DOI BibTeX RDF	Amalgamated direct sum, Blockwise direct sum, Density of coverings, Dual distance, Excess method, Sphere-covering bound, Normality, Reed-Muller codes, Covering radius, Binary codes, BCH codes
46	Yi Zhang, Chengwei Ma, Junfang Zhang, Midao Qin, Ruichun Liu	Heat Loss Through Covering Layer.	CCTA	2007	DBLP DOI BibTeX RDF	covering material, heat radiation, theoretical model, heat transfer, greenhouse
46	Victor Chepoi, Bertrand Estellon	Packing and Covering delta -Hyperbolic Spaces by Balls.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF	approximation algorithm, metric space, packing, covering, ball
46	Tingquan Deng, Yanmei Chen	On Reduction of Morphological Covering Rough Sets.	FSKD	2006	DBLP DOI BibTeX RDF	morphological covering, Rough set, reduction, morphological operators, adjunction
46	Chaoying Dai, Pak Ching Li, Michel Toulouse	A Cooperative Multilevel Tabu Search Algorithm for the Covering Design Problem.	Artificial Evolution	2005	DBLP DOI BibTeX RDF	Multilevel algorithms, Covering design problem, Tabu search meta-heuristic
46	Masaaki Harada, Michio Ozeki, Kenichiro Tanabe	On the Covering Radius of Ternary Extremal Self-Dual Codes.	Des. Codes Cryptogr.	2004	DBLP DOI BibTeX RDF	ternary code, covering radius, self-dual code
46	Christian Plessl, Marco Platzner	Instance-Specific Accelerators for Minimum Covering.	J. Supercomput.	2003	DBLP DOI BibTeX RDF	instance-specific acceleration, minimum covering, reconfigurable computing
46	Reuven Bar-Yehuda	One for the Price of Two: A Unified Approach for Approximating Covering Problems.	APPROX	1998	DBLP DOI BibTeX RDF	Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set
44	Yang Li, Lijun Ji, Jianxing Yin	Covering arrays of strength 3 and 4 from holey difference matrices.	Des. Codes Cryptogr.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05B20, 94C12, 05B15
44	Christos Koufogiannakis, Neal E. Young	Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.	ICALP (1)	2009	DBLP DOI BibTeX RDF
44	Tong-Jun Li	Rough Approximation Operators in Covering Approximation Spaces.	RSCTC	2006	DBLP DOI BibTeX RDF	rough sets, partitions, coverings, Approximation operators
44	Anupam Gupta 0001, Aravind Srinivasan	On the Covering Steiner Problem.	FSTTCS	2003	DBLP DOI BibTeX RDF
44	K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal	Lower Bounds for Group Covering Designs.	AAECC	1999	DBLP DOI BibTeX RDF
40	Baoqing Jiang, Keyun Qin, Zheng Pei 0001	On Transitive Uncertainty Mappings.	RSKT	2007	DBLP DOI BibTeX RDF	covering rough set, covering lower approximation, covering upper approximation, representative element, Rough set
40	Renée C. Bryce, Charles J. Colbourn	Test prioritization for pairwise interaction coverage.	ACM SIGSOFT Softw. Eng. Notes	2005	DBLP DOI BibTeX RDF	biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays
40	Renée C. Bryce, Charles J. Colbourn	Test prioritization for pairwise interaction coverage.	A-MOST	2005	DBLP DOI BibTeX RDF	biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays
40	Renée C. Bryce, Charles J. Colbourn	Constructing interaction test suites with greedy algorithms.	ASE	2005	DBLP DOI BibTeX RDF	biased covering arrays, t-way interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays
40	Rik Sarkar, Wei Zeng 0002, Jie Gao 0001, Xianfeng David Gu	Covering space for in-network sensor data storage.	IPSN	2010	DBLP DOI BibTeX RDF	Möbius transforms, Ricci flow, covering space, in-network storage, sensor networks, conformal mapping
40	Josue Bracho-Ríos, Jose Torres-Jimenez, Eduardo Rodriguez-Tello	A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength.	MICAI	2009	DBLP DOI BibTeX RDF	Software testing, Branch and Bound, Covering Arrays
40	Christos Koufogiannakis, Neal E. Young	Distributed and parallel algorithms for weighted vertex cover and other covering problems.	PODC	2009	DBLP DOI BibTeX RDF	distributed covering, distributed vertex cover
40	Heeralal Janwa, Arbind K. Lal	On Generalized Hamming Weights and the Covering Radius of Linear Codes.	AAECC	2007	DBLP DOI BibTeX RDF	Generalized Hamming weights, chain condition, generalized Griesmer bound, covering radius, cyclic codes, optimal codes, Griesmer bound
40	Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo	Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Set covering problem, Lagrangean relaxation, Multi-objective combinatorial optimization
40	Cemal Yilmaz 0001, Myra B. Cohen, Adam A. Porter	Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces.	IEEE Trans. Software Eng.	2006	DBLP DOI BibTeX RDF	fault characterization, Software testing, covering arrays, distributed continuous quality assurance
40	Stefan Porschen	Algorithms for Rectangular Covering Problems.	ICCSA (1)	2006	DBLP DOI BibTeX RDF	rectangular covering problem, integer grid, dynamic programming, closure operator
40	Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez	Effective bounding techniques for solving unate and binate covering problems.	DAC	2005	DBLP DOI BibTeX RDF	binate, unate, satisfiability, branch and bound, covering
40	Cyriel Van Nuffelen, Kristel Van Rompay	Upper bounds on the independence and the clique covering number.	4OR	2003	DBLP DOI BibTeX RDF	clique covering number, eigenvalues, adjacency matrix, independence number
40	Maria Axenovich, Zoltán Füredi	Exact Bounds on the Sizes of Covering Codes.	Des. Codes Cryptogr.	2003	DBLP DOI BibTeX RDF	supersaturated hypergraphs, Turán theorem, covering radius, binary codes
40	Reuven Bar-Yehuda	One for the Price of Two: a Unified Approach for Approximating Covering Problems.	Algorithmica	2000	DBLP DOI BibTeX RDF	Generalized Steiner Forest, Randomized approximations, Approximation algorithm, Set Cover, Vertex Cover, Covering problems, Primal-dual, Local ratio, Feedback Vertex Set
40	Stan Y. Liao, Srinivas Devadas	Solving Covering Problems Using LPR-Based Lower Bounds.	DAC	1997	DBLP DOI BibTeX RDF	integer linear programming, Covering problems
40	Patrick Solé, Arif Ghafoor	A Covering Problem in the Odd Graphs.	AAECC	1988	DBLP DOI BibTeX RDF	Odd Graphs, First order Reed Muller Code, Coset weight distribution, Interconnection Networks, Coding Theory, Covering Radius, Hadamard Matrices
39	André Bouchet	Coverings and Delta-Coverings.	IPCO	1995	DBLP DOI BibTeX RDF
38	Lu Ruan 0001, Ding-Zhu Du, Xiao-Dong Hu 0001, Xiaohua Jia, Deying Li 0001, Zheng Sun	Converter Placement Supporting Broadcast in WDM Optical Networks.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	converter placement, Color-Covering, Vertex Color-Covering, optical networks, WDM, Network optimization
38	Sandro Fouché, Myra B. Cohen, Adam A. Porter	Incremental covering array failure characterization in large configuration spaces.	ISSTA	2009	DBLP DOI BibTeX RDF	testing, distributed testing
38	Ilya Dumer	Covering Spheres with Spheres.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
38	Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi 0001	Restricted strip covering and the sensor cover problem.	SODA	2007	DBLP BibTeX RDF
38	Xunkai Wei, Ying-Hong Li 0003, Yufei Li	Optimum Neural Network Construction Via Linear Programming Minimum Sphere Set Covering.	ADMA	2007	DBLP DOI BibTeX RDF
38	Shu Zhao, Yanping Zhang, Ling Zhang, Ping Zhang, Ying-chun Zhang	Probability Model of Covering Algorithm (PMCA).	ICIC (1)	2006	DBLP DOI BibTeX RDF
38	Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco	Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
38	Lisa Fleischer	A fast approximation scheme for fractional covering problems with variable upper bounds.	SODA	2004	DBLP BibTeX RDF
38	John Shawe-Taylor, Nello Cristianini	Generalization Performance of Classifiers in Terms of Observed Covering Numbers.	EuroCOLT	1999	DBLP DOI BibTeX RDF
38	Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Steven W. K. Tjiang	Instruction selection using binate covering for code size optimization.	ICCAD	1995	DBLP DOI BibTeX RDF	code generation, digital signal processors, instruction selection
38	Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran	Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.	SCG	1988	DBLP DOI BibTeX RDF
37	Konrad J. Swanepoel	Simultaneous Packing and Covering in Sequence Spaces.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Simultaneous packing and covering constant, ? p sequence space, Closest packing, Loosest covering, Packings, Coverings
36	Tongjun Li, Jianmin Ma	Fuzzy Approximation Operators Based on Coverings.	RSFDGrC	2007	DBLP DOI BibTeX RDF	Crisp coverings, fuzzy coverings, fuzzy-covering-based fuzzy rough approximation operators, fuzzy sets, fuzzy partitions
36	Rongquan Feng, Jin Ho Kwak	Circulant Double Coverings of a Circulant Graph of Valency Four.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Graph covering, Voltage assignment, Cayley graph, Circulant graph
35	Jin Tian 0005, Minqiang Li, Fuzan Chen	A hybrid classification algorithm based on coevolutionary EBFNN and domain covering method.	Neural Comput. Appl.	2009	DBLP DOI BibTeX RDF	EBFNN, Cooperative coevolutionary algorithms, Domain covering method, Multiclass classification
35	Francisco de Assis Corrêa, Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena	Hybrid heuristics for the probabilistic maximal covering location-allocation problem.	Oper. Res.	2007	DBLP DOI BibTeX RDF	congested systems, covering problems, Location problems, clustering search
35	Brahim Hnich, Steven D. Prestwich, Evgeny Selensky, Barbara M. Smith	Constraint Models for the Covering Test Problem.	Constraints An Int. J.	2006	DBLP DOI BibTeX RDF	Chanelling constraints, Modelling, Testing, Local search, Symmetry, Global constraints, Covering arrays
35	J. Orestes Cerdeira, Leonor Santiago Pinto	Requiring Connectivity in the Set Covering Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	integer polytopes, graphs, set covering, connected components
35	Hirobumi Mizuno, Iwao Sato	Some L-Function of a Regular Covering of a Graph.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	L-Function, Graph covering, Group representation, Zeta function
35	Cemal Yilmaz 0001, Myra B. Cohen, Adam A. Porter	Covering arrays for efficient fault characterization in complex configuration spaces.	ISSTA	2004	DBLP DOI BibTeX RDF	fault characterization, software testing, covering arrays, distributed continuous quality assurance
35	Mahesh C. Bhandari, C. Durairajan 0001	A Note On Covering Radius Of Macdonald Codes.	ITCC	2003	DBLP DOI BibTeX RDF	MacDonald codes, Linear Codes, Covering radius, Optimal codes
35	Pierre-Olivier Ribet, François Vernadat 0001, Bernard Berthomieu	On Combining the Persistent Sets Method with the Covering Steps Graph Method.	FORTE	2002	DBLP DOI BibTeX RDF	persistent sets, covering steps graph, partial-order, Concurrent systems, state space exploration, verification methods
35	Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa	New Covering Radius of Reed-Muller Codes for t-Resilient Functions.	Selected Areas in Cryptography	2001	DBLP DOI BibTeX RDF	t-resilient function, stream cipher, Nonlinearity, Reed-Muller code, covering radius
35	Y. Kaipainen, K. Suominen	On the Covering Radius of Long 5-ary BCH Codes with Minimum Distance 7.	Appl. Algebra Eng. Commun. Comput.	1997	DBLP DOI BibTeX RDF	Resultant, Covering radius, BCH codes
35	Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Negative thinking by incremental problem solving: application to unate covering.	ICCAD	1997	DBLP DOI BibTeX RDF	negative thinking, discrete optimization, covering problem
35	Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger	On-line and Off-line Approximation Algorithms for Vector Covering Problems.	ESA	1996	DBLP DOI BibTeX RDF	Approximation algorithm, on-line algorithm, covering problem, packing problem, worst case ratio
34	Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu	Efficient Processing of Continual Range Queries for Location-Aware Mobile Services.	Inf. Syst. Frontiers	2005	DBLP DOI BibTeX RDF	mobile E-service, continual range queries, mobile computing, location-based service, query indexing, location-aware service
34	Chen Wu, Xibei Yang	Information granules in general and complete coverings.	GrC	2005	DBLP DOI BibTeX RDF
34	Igor B. Bourdonov	Traversal of an Unknown Directed Graph by a Finite Robot.	Program. Comput. Softw.	2004	DBLP DOI BibTeX RDF
32	Cevriye Gencer, Emel Kizilkaya Aydogan, Coskun Celik	A decision support system for locating VHF/UHF radio jammer systems on the terrain.	Inf. Syst. Frontiers	2008	DBLP DOI BibTeX RDF	Covering location problem, Maximum covering location problem, VHF/UHF radio jammer, Decision support system
32	John Shunen Shieh	Recursive morphological sieve method for searching pictorial point symbols on maps.	ICDAR	1995	DBLP DOI BibTeX RDF	recursive morphological sieve method, pictorial point symbol searching, positional data, point symbol identification, automatic map understanding, line symbols, morphological template matching method, K-tolerance covering, symbol kernel covering, morphologically preprocessed maps, multi-level sieves, screened out symbol kernels, sieve renewal, recursive screening process, pictorial point symbol recognition, documental files, image segmentation, edge detection, maps, identification, document image processing, cartography, partial ordering method, textured regions, colored regions
32	Peyman Nayeri, Charles J. Colbourn, Goran Konjevod	Randomized Postoptimization of Covering Arrays.	IWOCA	2009	DBLP DOI BibTeX RDF
32	B. K. Tripathy 0001, G. K. Panda	On some properties of covering based approximations of classifications of sets.	ICIS	2009	DBLP DOI BibTeX RDF	CB - rough sets and CB - approximations of classifications, approximations of classifications, classifications, rough sets
32	Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker	Roux-type constructions for covering arrays of strengths three and four.	Des. Codes Cryptogr.	2006	DBLP DOI BibTeX RDF	AMS Classification 05B40, 68N30, 05B15
32	William Zhu 0001, Fei-Yue Wang 0001	Properties of the First Type of Covering-Based Rough Sets.	ICDM Workshops	2006	DBLP DOI BibTeX RDF
32	Jun Hu 0002, Guoyin Wang 0001, Qinghua Zhang 0001	Uncertainty Measure of Covering Generated Rough Set.	IAT Workshops	2006	DBLP DOI BibTeX RDF
32	William Zhu 0001	Properties of the Second Type of Covering-Based Rough Sets.	IAT Workshops	2006	DBLP DOI BibTeX RDF
32	William Zhu 0001	Properties of the Fourth Type of Covering-Based Rough Sets.	HIS	2006	DBLP DOI BibTeX RDF
32	Michel X. Goemans, Jan Vondrák	Stochastic Covering and Adaptivity.	LATIN	2006	DBLP DOI BibTeX RDF
32	Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001	The complexity of the covering radius problem.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17
32	Ertem Tuncel, Jayanth Nayak, Kenneth Rose	On hierarchical type covering.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
32	Özgür Sümer	Partial covering of hypergraphs.	SODA	2005	DBLP BibTeX RDF	partial hypergraph cover, partial set cover, greedy algorithm
32	Niv Buchbinder, Joseph Naor	Online Primal-Dual Algorithms for Covering and Packing Problems.	ESA	2005	DBLP DOI BibTeX RDF
32	Gao Cong, Kian-Lee Tan, Anthony K. H. Tung, Xin Xu	Mining Top-k Covering Rule Groups for Gene Expression Data.	SIGMOD Conference	2005	DBLP DOI BibTeX RDF
32	Michel X. Goemans, Jan Vondrák	Covering minimum spanning trees of random subgraphs.	SODA	2004	DBLP BibTeX RDF
32	Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001	The Complexity of the Covering Radius Problem on Lattices and Codes.	CCC	2004	DBLP DOI BibTeX RDF
32	Vasco M. Manquinho, João Marques-Silva 0001	On Using Satisfiability-Based Pruning Techniques in Covering Algorithms.	DATE	2000	DBLP DOI BibTeX RDF
32	Patrick Solé	Covering Codes and Combinatorial Optimization.	AAECC	1991	DBLP DOI BibTeX RDF
32	Ravi Kannan, László Lovász 0001	Covering Minima and Lattice Point Free Convex Bodies.	FSTTCS	1986	DBLP DOI BibTeX RDF
31	Juriaan Simonis	Covering Radius: Improving on the Sphere-Covering Bound.	AAECC	1988	DBLP DOI BibTeX RDF
30	Philippe Langevin, Jean-Pierre Zanotti	Nonlinearity of Some Invariant Boolean Functions.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	cryptography, boolean functions, Fourier transforms, nonlinearity, characters, Reed-Muller codes, covering radius, finite groups